/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:41:15,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:41:15,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:41:15,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:41:15,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:41:15,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:41:15,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:41:15,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:41:15,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:41:15,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:41:15,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:41:15,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:41:15,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:41:15,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:41:15,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:41:15,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:41:15,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:41:15,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:41:15,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:41:15,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:41:15,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:41:15,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:41:15,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:41:15,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:41:15,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:41:15,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:41:15,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:41:15,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:41:15,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:41:15,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:41:15,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:41:15,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:41:15,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:41:15,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:41:15,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:41:15,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:41:15,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:41:15,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:41:15,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:41:15,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:41:15,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:41:15,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:41:15,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:41:15,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:41:15,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:41:15,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:41:15,973 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:41:15,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:41:15,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:41:15,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:41:15,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:41:15,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:41:15,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:41:15,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:41:15,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:41:15,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:41:15,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:41:15,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:41:15,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:15,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:41:15,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:41:15,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:41:15,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:41:15,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:41:15,979 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:41:15,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:41:15,979 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:41:15,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:41:16,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:41:16,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:41:16,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:41:16,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:41:16,281 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:41:16,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-27 17:41:16,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9afaebd/a369bbd75f8a49fd83fa77c468e3fc8f/FLAG304d6cba6 [2019-12-27 17:41:16,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:41:16,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-27 17:41:16,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9afaebd/a369bbd75f8a49fd83fa77c468e3fc8f/FLAG304d6cba6 [2019-12-27 17:41:17,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9afaebd/a369bbd75f8a49fd83fa77c468e3fc8f [2019-12-27 17:41:17,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:41:17,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:41:17,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:17,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:41:17,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:41:17,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:17" (1/1) ... [2019-12-27 17:41:17,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c6f947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:17, skipping insertion in model container [2019-12-27 17:41:17,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:41:17" (1/1) ... [2019-12-27 17:41:17,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:41:17,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:41:17,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:17,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:41:17,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:41:18,071 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:41:18,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18 WrapperNode [2019-12-27 17:41:18,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:41:18,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:18,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:41:18,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:41:18,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:41:18,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:41:18,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:41:18,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:41:18,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... [2019-12-27 17:41:18,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:41:18,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:41:18,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:41:18,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:41:18,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:41:18,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:41:18,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:41:18,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:41:18,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:41:18,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:41:18,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:41:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:41:18,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:41:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:41:18,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:41:18,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:41:18,281 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:41:19,361 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:41:19,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:41:19,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:19 BoogieIcfgContainer [2019-12-27 17:41:19,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:41:19,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:41:19,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:41:19,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:41:19,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:41:17" (1/3) ... [2019-12-27 17:41:19,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32866a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:19, skipping insertion in model container [2019-12-27 17:41:19,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:41:18" (2/3) ... [2019-12-27 17:41:19,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32866a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:41:19, skipping insertion in model container [2019-12-27 17:41:19,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:41:19" (3/3) ... [2019-12-27 17:41:19,372 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2019-12-27 17:41:19,382 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:41:19,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:41:19,390 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:41:19,391 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:41:19,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,474 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:41:19,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:41:19,554 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:41:19,554 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:41:19,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:41:19,554 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:41:19,554 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:41:19,555 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:41:19,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:41:19,555 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:41:19,574 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 17:41:19,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:19,819 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:19,819 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:19,871 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:19,942 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 17:41:20,082 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 17:41:20,082 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:41:20,102 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 17:41:20,144 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 17:41:20,145 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:41:22,927 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-27 17:41:27,757 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:41:27,867 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:41:27,984 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 17:41:27,984 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 17:41:27,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 17:41:42,344 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 17:41:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 17:41:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:41:42,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:42,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:41:42,352 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 17:41:42,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:42,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241689945] [2019-12-27 17:41:42,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:42,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241689945] [2019-12-27 17:41:42,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:42,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:41:42,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230991180] [2019-12-27 17:41:42,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:42,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:42,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:41:42,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:42,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:42,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:42,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:42,669 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 17:41:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:45,989 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 17:41:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:45,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:41:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:46,737 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 17:41:46,738 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 17:41:46,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 17:41:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 17:41:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 17:41:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 17:41:57,726 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 17:41:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:57,727 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 17:41:57,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 17:41:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:41:57,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:57,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:57,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 17:41:57,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:57,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893252527] [2019-12-27 17:41:57,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:57,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893252527] [2019-12-27 17:41:57,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:57,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:57,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716042880] [2019-12-27 17:41:57,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:57,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:57,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:41:57,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:57,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:41:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:41:57,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:41:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:41:57,895 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 5 states. [2019-12-27 17:42:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:02,680 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 17:42:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:02,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:42:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:03,096 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 17:42:03,097 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 17:42:03,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 17:42:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 17:42:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 17:42:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 17:42:13,348 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 17:42:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:13,348 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 17:42:13,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 17:42:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:42:13,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:13,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:13,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 17:42:13,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:13,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174574052] [2019-12-27 17:42:13,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:13,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174574052] [2019-12-27 17:42:13,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:13,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:13,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148939784] [2019-12-27 17:42:13,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:13,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:13,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:42:13,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:13,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:13,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:42:13,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:42:13,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:42:13,432 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 17:42:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:14,744 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 17:42:14,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:14,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:42:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:21,329 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 17:42:21,329 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 17:42:21,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 17:42:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 17:42:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 17:42:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 17:42:31,421 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 17:42:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:31,421 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 17:42:31,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:42:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 17:42:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:42:31,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:31,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:31,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 17:42:31,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:31,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872083980] [2019-12-27 17:42:31,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:31,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872083980] [2019-12-27 17:42:31,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:31,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:31,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375114268] [2019-12-27 17:42:31,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:31,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:31,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 17:42:31,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:32,712 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 17:42:32,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:42:32,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:32,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:32,731 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 6 states. [2019-12-27 17:42:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:33,331 INFO L93 Difference]: Finished difference Result 12803 states and 35243 transitions. [2019-12-27 17:42:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:33,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:42:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:33,343 INFO L225 Difference]: With dead ends: 12803 [2019-12-27 17:42:33,343 INFO L226 Difference]: Without dead ends: 9283 [2019-12-27 17:42:33,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9283 states. [2019-12-27 17:42:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9283 to 8738. [2019-12-27 17:42:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8738 states. [2019-12-27 17:42:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8738 states to 8738 states and 21907 transitions. [2019-12-27 17:42:33,451 INFO L78 Accepts]: Start accepts. Automaton has 8738 states and 21907 transitions. Word has length 17 [2019-12-27 17:42:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:33,451 INFO L462 AbstractCegarLoop]: Abstraction has 8738 states and 21907 transitions. [2019-12-27 17:42:33,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8738 states and 21907 transitions. [2019-12-27 17:42:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:42:33,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:33,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:33,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 17:42:33,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:33,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045688643] [2019-12-27 17:42:33,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:33,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045688643] [2019-12-27 17:42:33,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:33,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:33,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700702003] [2019-12-27 17:42:33,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:33,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:33,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 17:42:33,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:33,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:42:33,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:33,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:33,792 INFO L87 Difference]: Start difference. First operand 8738 states and 21907 transitions. Second operand 10 states. [2019-12-27 17:42:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:35,443 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-27 17:42:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:42:35,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-27 17:42:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:35,458 INFO L225 Difference]: With dead ends: 10286 [2019-12-27 17:42:35,458 INFO L226 Difference]: Without dead ends: 10286 [2019-12-27 17:42:35,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:42:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-27 17:42:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-27 17:42:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-27 17:42:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-27 17:42:35,613 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-27 17:42:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:35,614 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-27 17:42:35,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:42:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-27 17:42:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 17:42:35,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:35,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:35,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 17:42:35,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:35,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590672446] [2019-12-27 17:42:35,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:35,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590672446] [2019-12-27 17:42:35,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:35,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:35,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548165491] [2019-12-27 17:42:35,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:35,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:35,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 17:42:35,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:35,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:42:35,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:42:35,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:42:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:42:35,991 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 12 states. [2019-12-27 17:42:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:38,344 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-27 17:42:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:42:38,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-12-27 17:42:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:38,357 INFO L225 Difference]: With dead ends: 11186 [2019-12-27 17:42:38,358 INFO L226 Difference]: Without dead ends: 11138 [2019-12-27 17:42:38,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:42:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-27 17:42:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-27 17:42:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-27 17:42:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-27 17:42:38,542 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-27 17:42:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:38,542 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-27 17:42:38,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:42:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-27 17:42:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:42:38,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:38,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:38,559 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 17:42:38,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:38,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614207768] [2019-12-27 17:42:38,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:39,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614207768] [2019-12-27 17:42:39,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:39,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:39,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121528519] [2019-12-27 17:42:39,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:39,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:39,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 17:42:39,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:39,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:42:39,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:42:39,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:42:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:42:39,861 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 13 states. [2019-12-27 17:42:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:43,044 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-27 17:42:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:42:43,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-27 17:42:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:43,066 INFO L225 Difference]: With dead ends: 13021 [2019-12-27 17:42:43,066 INFO L226 Difference]: Without dead ends: 13021 [2019-12-27 17:42:43,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:42:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-27 17:42:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-27 17:42:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-27 17:42:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-27 17:42:43,312 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-27 17:42:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:43,313 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-27 17:42:43,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:42:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-27 17:42:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:42:43,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:43,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:43,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-27 17:42:43,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:43,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790701433] [2019-12-27 17:42:43,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790701433] [2019-12-27 17:42:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017470903] [2019-12-27 17:42:43,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:43,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:43,458 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 17:42:43,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:43,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:43,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:43,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:43,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:43,460 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-27 17:42:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:44,417 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-27 17:42:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:42:44,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 17:42:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:44,434 INFO L225 Difference]: With dead ends: 13152 [2019-12-27 17:42:44,434 INFO L226 Difference]: Without dead ends: 13152 [2019-12-27 17:42:44,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-27 17:42:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-27 17:42:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-27 17:42:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-27 17:42:44,585 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-27 17:42:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-27 17:42:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-27 17:42:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:42:44,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:44,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:44,600 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-27 17:42:44,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:44,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765534358] [2019-12-27 17:42:44,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:46,164 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-12-27 17:42:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:46,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765534358] [2019-12-27 17:42:46,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:46,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:42:46,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960876007] [2019-12-27 17:42:46,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:46,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:46,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 17:42:46,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:46,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:46,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:46,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:46,239 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-27 17:42:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:46,402 INFO L93 Difference]: Finished difference Result 13209 states and 31846 transitions. [2019-12-27 17:42:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:46,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:42:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:46,418 INFO L225 Difference]: With dead ends: 13209 [2019-12-27 17:42:46,419 INFO L226 Difference]: Without dead ends: 13009 [2019-12-27 17:42:46,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:42:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2019-12-27 17:42:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12709. [2019-12-27 17:42:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-27 17:42:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 30712 transitions. [2019-12-27 17:42:46,567 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 30712 transitions. Word has length 58 [2019-12-27 17:42:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:46,567 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 30712 transitions. [2019-12-27 17:42:46,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 30712 transitions. [2019-12-27 17:42:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:42:46,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:46,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:46,578 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1587335685, now seen corresponding path program 1 times [2019-12-27 17:42:46,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:46,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101103791] [2019-12-27 17:42:46,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:46,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101103791] [2019-12-27 17:42:46,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:46,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:42:46,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420851057] [2019-12-27 17:42:46,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:46,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:46,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 220 transitions. [2019-12-27 17:42:46,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:46,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:46,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:46,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:46,834 INFO L87 Difference]: Start difference. First operand 12709 states and 30712 transitions. Second operand 6 states. [2019-12-27 17:42:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:46,906 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-27 17:42:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:42:46,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 17:42:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:46,915 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 17:42:46,915 INFO L226 Difference]: Without dead ends: 5151 [2019-12-27 17:42:46,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-27 17:42:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-27 17:42:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 17:42:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-27 17:42:47,009 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 64 [2019-12-27 17:42:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:47,010 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-27 17:42:47,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-27 17:42:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 17:42:47,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:47,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:47,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 17:42:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:47,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375292078] [2019-12-27 17:42:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:47,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375292078] [2019-12-27 17:42:47,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:47,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:42:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777913780] [2019-12-27 17:42:47,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:47,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:47,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 17:42:47,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:47,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:47,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:42:47,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:42:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:42:47,403 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 3 states. [2019-12-27 17:42:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:47,470 INFO L93 Difference]: Finished difference Result 4998 states and 11711 transitions. [2019-12-27 17:42:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:42:47,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 17:42:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:47,475 INFO L225 Difference]: With dead ends: 4998 [2019-12-27 17:42:47,475 INFO L226 Difference]: Without dead ends: 4998 [2019-12-27 17:42:47,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:42:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-27 17:42:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4986. [2019-12-27 17:42:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-12-27 17:42:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 11689 transitions. [2019-12-27 17:42:47,526 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 11689 transitions. Word has length 94 [2019-12-27 17:42:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:47,526 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 11689 transitions. [2019-12-27 17:42:47,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:42:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 11689 transitions. [2019-12-27 17:42:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:47,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:47,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:47,533 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash 154163826, now seen corresponding path program 1 times [2019-12-27 17:42:47,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:47,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570780911] [2019-12-27 17:42:47,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:47,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570780911] [2019-12-27 17:42:47,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:47,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797782673] [2019-12-27 17:42:47,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:47,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:47,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 17:42:47,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:47,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:42:47,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:47,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:47,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:47,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:47,863 INFO L87 Difference]: Start difference. First operand 4986 states and 11689 transitions. Second operand 6 states. [2019-12-27 17:42:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:48,461 INFO L93 Difference]: Finished difference Result 5215 states and 12144 transitions. [2019-12-27 17:42:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:48,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 17:42:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:48,468 INFO L225 Difference]: With dead ends: 5215 [2019-12-27 17:42:48,468 INFO L226 Difference]: Without dead ends: 5215 [2019-12-27 17:42:48,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-12-27 17:42:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 4998. [2019-12-27 17:42:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 17:42:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11711 transitions. [2019-12-27 17:42:48,529 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11711 transitions. Word has length 95 [2019-12-27 17:42:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:48,530 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11711 transitions. [2019-12-27 17:42:48,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11711 transitions. [2019-12-27 17:42:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:48,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:48,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:48,537 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash 594436802, now seen corresponding path program 2 times [2019-12-27 17:42:48,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:48,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333930738] [2019-12-27 17:42:48,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:48,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333930738] [2019-12-27 17:42:48,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:48,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:42:48,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565482874] [2019-12-27 17:42:48,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:48,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:49,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 329 transitions. [2019-12-27 17:42:49,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:49,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:42:49,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:42:49,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:42:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:42:49,116 INFO L87 Difference]: Start difference. First operand 4998 states and 11711 transitions. Second operand 5 states. [2019-12-27 17:42:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:49,724 INFO L93 Difference]: Finished difference Result 5486 states and 12718 transitions. [2019-12-27 17:42:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:42:49,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 17:42:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:49,732 INFO L225 Difference]: With dead ends: 5486 [2019-12-27 17:42:49,732 INFO L226 Difference]: Without dead ends: 5486 [2019-12-27 17:42:49,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2019-12-27 17:42:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 5139. [2019-12-27 17:42:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5139 states. [2019-12-27 17:42:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 12032 transitions. [2019-12-27 17:42:49,871 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 12032 transitions. Word has length 95 [2019-12-27 17:42:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:49,872 INFO L462 AbstractCegarLoop]: Abstraction has 5139 states and 12032 transitions. [2019-12-27 17:42:49,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:42:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 12032 transitions. [2019-12-27 17:42:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:49,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:49,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:49,882 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1854124544, now seen corresponding path program 3 times [2019-12-27 17:42:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822218398] [2019-12-27 17:42:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:50,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822218398] [2019-12-27 17:42:50,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:50,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:50,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121756528] [2019-12-27 17:42:50,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:50,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:50,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 232 transitions. [2019-12-27 17:42:50,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:50,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:42:50,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:50,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:50,204 INFO L87 Difference]: Start difference. First operand 5139 states and 12032 transitions. Second operand 6 states. [2019-12-27 17:42:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:50,854 INFO L93 Difference]: Finished difference Result 5457 states and 12639 transitions. [2019-12-27 17:42:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:50,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 17:42:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:50,861 INFO L225 Difference]: With dead ends: 5457 [2019-12-27 17:42:50,861 INFO L226 Difference]: Without dead ends: 5457 [2019-12-27 17:42:50,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-12-27 17:42:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5223. [2019-12-27 17:42:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5223 states. [2019-12-27 17:42:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5223 states to 5223 states and 12204 transitions. [2019-12-27 17:42:50,924 INFO L78 Accepts]: Start accepts. Automaton has 5223 states and 12204 transitions. Word has length 95 [2019-12-27 17:42:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:50,924 INFO L462 AbstractCegarLoop]: Abstraction has 5223 states and 12204 transitions. [2019-12-27 17:42:50,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5223 states and 12204 transitions. [2019-12-27 17:42:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:50,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:50,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:50,931 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1605437190, now seen corresponding path program 4 times [2019-12-27 17:42:50,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:50,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093738936] [2019-12-27 17:42:50,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:51,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093738936] [2019-12-27 17:42:51,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:51,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:42:51,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774472462] [2019-12-27 17:42:51,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:51,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:51,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 225 transitions. [2019-12-27 17:42:51,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:51,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:42:51,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:51,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:51,534 INFO L87 Difference]: Start difference. First operand 5223 states and 12204 transitions. Second operand 10 states. [2019-12-27 17:42:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:52,922 INFO L93 Difference]: Finished difference Result 12991 states and 29353 transitions. [2019-12-27 17:42:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:42:52,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 17:42:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:52,936 INFO L225 Difference]: With dead ends: 12991 [2019-12-27 17:42:52,937 INFO L226 Difference]: Without dead ends: 11025 [2019-12-27 17:42:52,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:42:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11025 states. [2019-12-27 17:42:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11025 to 6894. [2019-12-27 17:42:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2019-12-27 17:42:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 16489 transitions. [2019-12-27 17:42:53,096 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 16489 transitions. Word has length 95 [2019-12-27 17:42:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:53,097 INFO L462 AbstractCegarLoop]: Abstraction has 6894 states and 16489 transitions. [2019-12-27 17:42:53,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:42:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 16489 transitions. [2019-12-27 17:42:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:53,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:53,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:53,115 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1454072868, now seen corresponding path program 5 times [2019-12-27 17:42:53,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:53,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602150165] [2019-12-27 17:42:53,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:53,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602150165] [2019-12-27 17:42:53,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:53,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:53,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236232472] [2019-12-27 17:42:53,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:53,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:53,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 228 transitions. [2019-12-27 17:42:53,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:53,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:42:53,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:42:53,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:53,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:42:53,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:42:53,523 INFO L87 Difference]: Start difference. First operand 6894 states and 16489 transitions. Second operand 6 states. [2019-12-27 17:42:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:54,164 INFO L93 Difference]: Finished difference Result 7309 states and 17294 transitions. [2019-12-27 17:42:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:42:54,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 17:42:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:54,174 INFO L225 Difference]: With dead ends: 7309 [2019-12-27 17:42:54,175 INFO L226 Difference]: Without dead ends: 7309 [2019-12-27 17:42:54,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:42:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2019-12-27 17:42:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 7006. [2019-12-27 17:42:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7006 states. [2019-12-27 17:42:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7006 states to 7006 states and 16718 transitions. [2019-12-27 17:42:54,260 INFO L78 Accepts]: Start accepts. Automaton has 7006 states and 16718 transitions. Word has length 95 [2019-12-27 17:42:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:54,260 INFO L462 AbstractCegarLoop]: Abstraction has 7006 states and 16718 transitions. [2019-12-27 17:42:54,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:42:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7006 states and 16718 transitions. [2019-12-27 17:42:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:54,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:54,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:54,267 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 822691358, now seen corresponding path program 6 times [2019-12-27 17:42:54,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:54,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421404911] [2019-12-27 17:42:54,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:54,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421404911] [2019-12-27 17:42:54,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:54,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:42:54,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188884810] [2019-12-27 17:42:54,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:54,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:54,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 248 transitions. [2019-12-27 17:42:54,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:54,753 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:42:54,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:42:54,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:42:54,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:42:54,755 INFO L87 Difference]: Start difference. First operand 7006 states and 16718 transitions. Second operand 9 states. [2019-12-27 17:42:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:42:58,464 INFO L93 Difference]: Finished difference Result 30972 states and 74253 transitions. [2019-12-27 17:42:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:42:58,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 17:42:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:42:58,498 INFO L225 Difference]: With dead ends: 30972 [2019-12-27 17:42:58,498 INFO L226 Difference]: Without dead ends: 30972 [2019-12-27 17:42:58,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:42:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30972 states. [2019-12-27 17:42:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30972 to 10372. [2019-12-27 17:42:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-12-27 17:42:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 25144 transitions. [2019-12-27 17:42:58,792 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 25144 transitions. Word has length 95 [2019-12-27 17:42:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:42:58,792 INFO L462 AbstractCegarLoop]: Abstraction has 10372 states and 25144 transitions. [2019-12-27 17:42:58,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:42:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 25144 transitions. [2019-12-27 17:42:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:42:58,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:42:58,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:42:58,803 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:42:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:42:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 75442206, now seen corresponding path program 7 times [2019-12-27 17:42:58,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:42:58,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061923069] [2019-12-27 17:42:58,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:42:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:42:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:42:58,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061923069] [2019-12-27 17:42:58,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:42:58,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:42:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882815223] [2019-12-27 17:42:58,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:42:58,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:42:59,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 244 transitions. [2019-12-27 17:42:59,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:42:59,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:42:59,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:42:59,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:42:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:42:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:42:59,295 INFO L87 Difference]: Start difference. First operand 10372 states and 25144 transitions. Second operand 10 states. [2019-12-27 17:43:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:03,537 INFO L93 Difference]: Finished difference Result 31007 states and 74309 transitions. [2019-12-27 17:43:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:43:03,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 17:43:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:03,570 INFO L225 Difference]: With dead ends: 31007 [2019-12-27 17:43:03,570 INFO L226 Difference]: Without dead ends: 31007 [2019-12-27 17:43:03,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2019-12-27 17:43:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31007 states. [2019-12-27 17:43:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31007 to 10294. [2019-12-27 17:43:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10294 states. [2019-12-27 17:43:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10294 states to 10294 states and 24982 transitions. [2019-12-27 17:43:03,800 INFO L78 Accepts]: Start accepts. Automaton has 10294 states and 24982 transitions. Word has length 95 [2019-12-27 17:43:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:03,800 INFO L462 AbstractCegarLoop]: Abstraction has 10294 states and 24982 transitions. [2019-12-27 17:43:03,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10294 states and 24982 transitions. [2019-12-27 17:43:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:03,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:03,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:03,810 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 8 times [2019-12-27 17:43:03,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:03,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184342124] [2019-12-27 17:43:03,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:03,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184342124] [2019-12-27 17:43:03,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:03,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:43:03,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581388966] [2019-12-27 17:43:03,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:03,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:04,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 228 transitions. [2019-12-27 17:43:04,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:04,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:43:04,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:43:04,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:43:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:43:04,247 INFO L87 Difference]: Start difference. First operand 10294 states and 24982 transitions. Second operand 8 states. [2019-12-27 17:43:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:05,176 INFO L93 Difference]: Finished difference Result 11086 states and 26601 transitions. [2019-12-27 17:43:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:05,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 17:43:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:05,191 INFO L225 Difference]: With dead ends: 11086 [2019-12-27 17:43:05,191 INFO L226 Difference]: Without dead ends: 11086 [2019-12-27 17:43:05,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-12-27 17:43:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 10327. [2019-12-27 17:43:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10327 states. [2019-12-27 17:43:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 25069 transitions. [2019-12-27 17:43:05,322 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 25069 transitions. Word has length 95 [2019-12-27 17:43:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 10327 states and 25069 transitions. [2019-12-27 17:43:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:43:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 25069 transitions. [2019-12-27 17:43:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 17:43:05,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:05,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:05,334 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 655556820, now seen corresponding path program 9 times [2019-12-27 17:43:05,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:05,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474923536] [2019-12-27 17:43:05,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:05,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474923536] [2019-12-27 17:43:05,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:05,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:43:05,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770264393] [2019-12-27 17:43:05,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:05,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:05,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 165 transitions. [2019-12-27 17:43:05,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:05,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:05,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:43:05,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:43:05,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:43:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:43:05,855 INFO L87 Difference]: Start difference. First operand 10327 states and 25069 transitions. Second operand 13 states. [2019-12-27 17:43:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:08,601 INFO L93 Difference]: Finished difference Result 17177 states and 41986 transitions. [2019-12-27 17:43:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:43:08,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-27 17:43:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:08,621 INFO L225 Difference]: With dead ends: 17177 [2019-12-27 17:43:08,621 INFO L226 Difference]: Without dead ends: 17135 [2019-12-27 17:43:08,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:43:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2019-12-27 17:43:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 10293. [2019-12-27 17:43:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10293 states. [2019-12-27 17:43:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10293 states to 10293 states and 24884 transitions. [2019-12-27 17:43:08,772 INFO L78 Accepts]: Start accepts. Automaton has 10293 states and 24884 transitions. Word has length 95 [2019-12-27 17:43:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:08,772 INFO L462 AbstractCegarLoop]: Abstraction has 10293 states and 24884 transitions. [2019-12-27 17:43:08,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:43:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10293 states and 24884 transitions. [2019-12-27 17:43:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:08,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:08,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:08,785 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-27 17:43:08,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:08,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263287899] [2019-12-27 17:43:08,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:08,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263287899] [2019-12-27 17:43:08,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:08,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:08,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497663710] [2019-12-27 17:43:08,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:08,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:09,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 162 transitions. [2019-12-27 17:43:09,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:09,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:09,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:09,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:09,227 INFO L87 Difference]: Start difference. First operand 10293 states and 24884 transitions. Second operand 11 states. [2019-12-27 17:43:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:11,522 INFO L93 Difference]: Finished difference Result 53934 states and 129995 transitions. [2019-12-27 17:43:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 17:43:11,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:11,575 INFO L225 Difference]: With dead ends: 53934 [2019-12-27 17:43:11,575 INFO L226 Difference]: Without dead ends: 40787 [2019-12-27 17:43:11,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 17:43:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40787 states. [2019-12-27 17:43:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40787 to 13861. [2019-12-27 17:43:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13861 states. [2019-12-27 17:43:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13861 states to 13861 states and 33844 transitions. [2019-12-27 17:43:11,901 INFO L78 Accepts]: Start accepts. Automaton has 13861 states and 33844 transitions. Word has length 96 [2019-12-27 17:43:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:11,901 INFO L462 AbstractCegarLoop]: Abstraction has 13861 states and 33844 transitions. [2019-12-27 17:43:11,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13861 states and 33844 transitions. [2019-12-27 17:43:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:11,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:11,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:11,919 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-27 17:43:11,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:11,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663819704] [2019-12-27 17:43:11,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:12,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663819704] [2019-12-27 17:43:12,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:12,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:43:12,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1130813191] [2019-12-27 17:43:12,010 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:12,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:12,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 17:43:12,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:12,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:12,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:43:12,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:43:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:43:12,203 INFO L87 Difference]: Start difference. First operand 13861 states and 33844 transitions. Second operand 6 states. [2019-12-27 17:43:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:13,232 INFO L93 Difference]: Finished difference Result 27055 states and 61408 transitions. [2019-12-27 17:43:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:43:13,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 17:43:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:13,266 INFO L225 Difference]: With dead ends: 27055 [2019-12-27 17:43:13,266 INFO L226 Difference]: Without dead ends: 27055 [2019-12-27 17:43:13,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27055 states. [2019-12-27 17:43:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27055 to 20704. [2019-12-27 17:43:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20704 states. [2019-12-27 17:43:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 47769 transitions. [2019-12-27 17:43:13,563 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 47769 transitions. Word has length 96 [2019-12-27 17:43:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:13,563 INFO L462 AbstractCegarLoop]: Abstraction has 20704 states and 47769 transitions. [2019-12-27 17:43:13,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:43:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 47769 transitions. [2019-12-27 17:43:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:13,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:13,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:13,583 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 3 times [2019-12-27 17:43:13,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:13,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218648209] [2019-12-27 17:43:13,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:13,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218648209] [2019-12-27 17:43:13,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:13,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:13,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103763779] [2019-12-27 17:43:13,766 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:13,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:13,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 17:43:13,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:13,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:43:13,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:43:13,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:43:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:43:13,967 INFO L87 Difference]: Start difference. First operand 20704 states and 47769 transitions. Second operand 10 states. [2019-12-27 17:43:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:14,904 INFO L93 Difference]: Finished difference Result 32239 states and 73118 transitions. [2019-12-27 17:43:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:43:14,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 17:43:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:14,940 INFO L225 Difference]: With dead ends: 32239 [2019-12-27 17:43:14,940 INFO L226 Difference]: Without dead ends: 30568 [2019-12-27 17:43:14,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:43:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30568 states. [2019-12-27 17:43:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30568 to 24784. [2019-12-27 17:43:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24784 states. [2019-12-27 17:43:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24784 states to 24784 states and 57538 transitions. [2019-12-27 17:43:15,412 INFO L78 Accepts]: Start accepts. Automaton has 24784 states and 57538 transitions. Word has length 96 [2019-12-27 17:43:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:15,412 INFO L462 AbstractCegarLoop]: Abstraction has 24784 states and 57538 transitions. [2019-12-27 17:43:15,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:43:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24784 states and 57538 transitions. [2019-12-27 17:43:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:15,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:15,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:15,436 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 4 times [2019-12-27 17:43:15,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794520719] [2019-12-27 17:43:15,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:15,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794520719] [2019-12-27 17:43:15,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:15,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:43:15,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1257981101] [2019-12-27 17:43:15,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:15,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:15,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 217 transitions. [2019-12-27 17:43:15,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:15,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:43:15,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:43:15,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:43:15,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:43:15,776 INFO L87 Difference]: Start difference. First operand 24784 states and 57538 transitions. Second operand 7 states. [2019-12-27 17:43:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:16,970 INFO L93 Difference]: Finished difference Result 32253 states and 73680 transitions. [2019-12-27 17:43:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:43:16,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-27 17:43:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:17,008 INFO L225 Difference]: With dead ends: 32253 [2019-12-27 17:43:17,008 INFO L226 Difference]: Without dead ends: 32253 [2019-12-27 17:43:17,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:43:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32253 states. [2019-12-27 17:43:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32253 to 24822. [2019-12-27 17:43:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24822 states. [2019-12-27 17:43:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24822 states to 24822 states and 57623 transitions. [2019-12-27 17:43:17,409 INFO L78 Accepts]: Start accepts. Automaton has 24822 states and 57623 transitions. Word has length 96 [2019-12-27 17:43:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:17,410 INFO L462 AbstractCegarLoop]: Abstraction has 24822 states and 57623 transitions. [2019-12-27 17:43:17,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:43:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24822 states and 57623 transitions. [2019-12-27 17:43:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:17,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:17,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:17,438 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2009108450, now seen corresponding path program 5 times [2019-12-27 17:43:17,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:17,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172446399] [2019-12-27 17:43:17,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:17,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172446399] [2019-12-27 17:43:17,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:17,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:43:17,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668795070] [2019-12-27 17:43:17,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:17,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:17,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 269 transitions. [2019-12-27 17:43:17,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:18,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 17:43:18,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:43:18,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:43:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:43:18,074 INFO L87 Difference]: Start difference. First operand 24822 states and 57623 transitions. Second operand 17 states. [2019-12-27 17:43:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:22,761 INFO L93 Difference]: Finished difference Result 44339 states and 99230 transitions. [2019-12-27 17:43:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 17:43:22,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 17:43:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:22,807 INFO L225 Difference]: With dead ends: 44339 [2019-12-27 17:43:22,807 INFO L226 Difference]: Without dead ends: 41432 [2019-12-27 17:43:22,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=923, Invalid=5557, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 17:43:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41432 states. [2019-12-27 17:43:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41432 to 28761. [2019-12-27 17:43:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28761 states. [2019-12-27 17:43:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28761 states to 28761 states and 66609 transitions. [2019-12-27 17:43:23,375 INFO L78 Accepts]: Start accepts. Automaton has 28761 states and 66609 transitions. Word has length 96 [2019-12-27 17:43:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:23,375 INFO L462 AbstractCegarLoop]: Abstraction has 28761 states and 66609 transitions. [2019-12-27 17:43:23,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:43:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28761 states and 66609 transitions. [2019-12-27 17:43:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:23,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:23,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:23,401 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2022731266, now seen corresponding path program 6 times [2019-12-27 17:43:23,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:23,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286424095] [2019-12-27 17:43:23,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:23,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286424095] [2019-12-27 17:43:23,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:23,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:43:23,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760642319] [2019-12-27 17:43:23,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:23,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:23,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 274 transitions. [2019-12-27 17:43:23,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:23,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:43:23,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:43:23,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:43:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:43:23,854 INFO L87 Difference]: Start difference. First operand 28761 states and 66609 transitions. Second operand 11 states. [2019-12-27 17:43:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:26,463 INFO L93 Difference]: Finished difference Result 51767 states and 114807 transitions. [2019-12-27 17:43:26,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 17:43:26,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 17:43:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:26,704 INFO L225 Difference]: With dead ends: 51767 [2019-12-27 17:43:26,704 INFO L226 Difference]: Without dead ends: 50360 [2019-12-27 17:43:26,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1872, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 17:43:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50360 states. [2019-12-27 17:43:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50360 to 29388. [2019-12-27 17:43:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29388 states. [2019-12-27 17:43:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29388 states to 29388 states and 68148 transitions. [2019-12-27 17:43:27,239 INFO L78 Accepts]: Start accepts. Automaton has 29388 states and 68148 transitions. Word has length 96 [2019-12-27 17:43:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:27,240 INFO L462 AbstractCegarLoop]: Abstraction has 29388 states and 68148 transitions. [2019-12-27 17:43:27,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:43:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29388 states and 68148 transitions. [2019-12-27 17:43:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:27,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:27,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:27,267 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2040794935, now seen corresponding path program 1 times [2019-12-27 17:43:27,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:27,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991873200] [2019-12-27 17:43:27,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:27,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991873200] [2019-12-27 17:43:27,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:27,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:43:27,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866632351] [2019-12-27 17:43:27,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:27,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:27,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 270 transitions. [2019-12-27 17:43:27,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:27,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:27,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:43:27,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:43:27,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:43:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:27,828 INFO L87 Difference]: Start difference. First operand 29388 states and 68148 transitions. Second operand 16 states. [2019-12-27 17:43:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:32,534 INFO L93 Difference]: Finished difference Result 37109 states and 84138 transitions. [2019-12-27 17:43:32,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 17:43:32,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 17:43:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:32,580 INFO L225 Difference]: With dead ends: 37109 [2019-12-27 17:43:32,580 INFO L226 Difference]: Without dead ends: 37019 [2019-12-27 17:43:32,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:43:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37019 states. [2019-12-27 17:43:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37019 to 30861. [2019-12-27 17:43:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30861 states. [2019-12-27 17:43:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30861 states to 30861 states and 71385 transitions. [2019-12-27 17:43:32,994 INFO L78 Accepts]: Start accepts. Automaton has 30861 states and 71385 transitions. Word has length 96 [2019-12-27 17:43:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:32,994 INFO L462 AbstractCegarLoop]: Abstraction has 30861 states and 71385 transitions. [2019-12-27 17:43:32,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:43:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30861 states and 71385 transitions. [2019-12-27 17:43:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:33,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:33,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:33,023 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 138397884, now seen corresponding path program 7 times [2019-12-27 17:43:33,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:33,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247653604] [2019-12-27 17:43:33,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:33,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247653604] [2019-12-27 17:43:33,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:33,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:43:33,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260057824] [2019-12-27 17:43:33,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:33,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:33,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 218 transitions. [2019-12-27 17:43:33,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:33,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:43:33,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:43:33,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:43:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:43:33,414 INFO L87 Difference]: Start difference. First operand 30861 states and 71385 transitions. Second operand 12 states. [2019-12-27 17:43:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:36,760 INFO L93 Difference]: Finished difference Result 59180 states and 131721 transitions. [2019-12-27 17:43:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 17:43:36,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 17:43:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:36,831 INFO L225 Difference]: With dead ends: 59180 [2019-12-27 17:43:36,832 INFO L226 Difference]: Without dead ends: 57663 [2019-12-27 17:43:36,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=3050, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 17:43:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57663 states. [2019-12-27 17:43:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57663 to 31448. [2019-12-27 17:43:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31448 states. [2019-12-27 17:43:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31448 states to 31448 states and 72999 transitions. [2019-12-27 17:43:37,441 INFO L78 Accepts]: Start accepts. Automaton has 31448 states and 72999 transitions. Word has length 96 [2019-12-27 17:43:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:37,442 INFO L462 AbstractCegarLoop]: Abstraction has 31448 states and 72999 transitions. [2019-12-27 17:43:37,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:43:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31448 states and 72999 transitions. [2019-12-27 17:43:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:37,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:37,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:37,470 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash 369838979, now seen corresponding path program 2 times [2019-12-27 17:43:37,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:37,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068814619] [2019-12-27 17:43:37,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:37,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068814619] [2019-12-27 17:43:37,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:37,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 17:43:37,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602229226] [2019-12-27 17:43:37,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:38,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:38,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 214 transitions. [2019-12-27 17:43:38,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:38,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:38,548 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-27 17:43:38,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:43:38,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:43:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:43:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:43:38,550 INFO L87 Difference]: Start difference. First operand 31448 states and 72999 transitions. Second operand 19 states. [2019-12-27 17:43:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:50,123 INFO L93 Difference]: Finished difference Result 73896 states and 166924 transitions. [2019-12-27 17:43:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-27 17:43:50,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-27 17:43:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:50,219 INFO L225 Difference]: With dead ends: 73896 [2019-12-27 17:43:50,219 INFO L226 Difference]: Without dead ends: 73818 [2019-12-27 17:43:50,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4092 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1389, Invalid=10167, Unknown=0, NotChecked=0, Total=11556 [2019-12-27 17:43:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73818 states. [2019-12-27 17:43:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73818 to 45204. [2019-12-27 17:43:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45204 states. [2019-12-27 17:43:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45204 states to 45204 states and 104449 transitions. [2019-12-27 17:43:51,030 INFO L78 Accepts]: Start accepts. Automaton has 45204 states and 104449 transitions. Word has length 96 [2019-12-27 17:43:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:51,031 INFO L462 AbstractCegarLoop]: Abstraction has 45204 states and 104449 transitions. [2019-12-27 17:43:51,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:43:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 45204 states and 104449 transitions. [2019-12-27 17:43:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 17:43:51,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:51,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:51,071 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2082560497, now seen corresponding path program 1 times [2019-12-27 17:43:51,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:51,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203477041] [2019-12-27 17:43:51,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:51,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203477041] [2019-12-27 17:43:51,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:51,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:43:51,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761022515] [2019-12-27 17:43:51,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:51,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:52,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 165 transitions. [2019-12-27 17:43:52,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:52,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:52,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:52,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:52,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:43:52,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:43:52,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:43:52,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:43:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:43:52,198 INFO L87 Difference]: Start difference. First operand 45204 states and 104449 transitions. Second operand 16 states. [2019-12-27 17:43:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:43:55,799 INFO L93 Difference]: Finished difference Result 64552 states and 148761 transitions. [2019-12-27 17:43:55,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 17:43:55,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 17:43:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:43:55,889 INFO L225 Difference]: With dead ends: 64552 [2019-12-27 17:43:55,889 INFO L226 Difference]: Without dead ends: 64552 [2019-12-27 17:43:55,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 17:43:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64552 states. [2019-12-27 17:43:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64552 to 45096. [2019-12-27 17:43:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45096 states. [2019-12-27 17:43:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45096 states to 45096 states and 104217 transitions. [2019-12-27 17:43:56,563 INFO L78 Accepts]: Start accepts. Automaton has 45096 states and 104217 transitions. Word has length 96 [2019-12-27 17:43:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:43:56,563 INFO L462 AbstractCegarLoop]: Abstraction has 45096 states and 104217 transitions. [2019-12-27 17:43:56,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:43:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45096 states and 104217 transitions. [2019-12-27 17:43:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:43:56,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:43:56,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:43:56,603 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:43:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:43:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 573569679, now seen corresponding path program 1 times [2019-12-27 17:43:56,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:43:56,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432434033] [2019-12-27 17:43:56,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:43:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:43:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:43:57,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432434033] [2019-12-27 17:43:57,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:43:57,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:43:57,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677797706] [2019-12-27 17:43:57,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:43:57,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:43:57,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 200 transitions. [2019-12-27 17:43:57,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:43:57,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:43:57,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 17:43:57,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:43:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 17:43:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:43:57,730 INFO L87 Difference]: Start difference. First operand 45096 states and 104217 transitions. Second operand 20 states. [2019-12-27 17:43:58,399 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 17:44:01,139 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 17:44:01,716 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 17:44:03,307 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-27 17:44:04,700 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:44:04,907 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 17:44:05,453 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 17:44:06,062 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-27 17:44:07,205 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-27 17:44:09,791 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 17:44:10,232 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 17:44:11,690 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-12-27 17:44:11,943 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-27 17:44:12,128 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-27 17:44:12,328 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 17:44:13,488 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-27 17:44:13,749 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 17:44:14,727 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-27 17:44:25,992 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-27 17:44:26,639 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-27 17:44:28,765 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-12-27 17:44:29,177 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-12-27 17:44:29,683 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-27 17:44:30,464 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 17:44:30,700 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-12-27 17:44:31,209 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-27 17:44:31,681 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-12-27 17:44:32,522 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-12-27 17:44:32,885 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-12-27 17:44:36,003 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-27 17:44:37,301 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-27 17:44:38,304 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-27 17:44:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:46,407 INFO L93 Difference]: Finished difference Result 149662 states and 332615 transitions. [2019-12-27 17:44:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2019-12-27 17:44:46,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-27 17:44:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:46,560 INFO L225 Difference]: With dead ends: 149662 [2019-12-27 17:44:46,561 INFO L226 Difference]: Without dead ends: 130048 [2019-12-27 17:44:46,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54762 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=10824, Invalid=108546, Unknown=0, NotChecked=0, Total=119370 [2019-12-27 17:44:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130048 states. [2019-12-27 17:44:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130048 to 53646. [2019-12-27 17:44:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53646 states. [2019-12-27 17:44:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53646 states to 53646 states and 124117 transitions. [2019-12-27 17:44:48,026 INFO L78 Accepts]: Start accepts. Automaton has 53646 states and 124117 transitions. Word has length 97 [2019-12-27 17:44:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:48,027 INFO L462 AbstractCegarLoop]: Abstraction has 53646 states and 124117 transitions. [2019-12-27 17:44:48,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 17:44:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53646 states and 124117 transitions. [2019-12-27 17:44:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:48,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:48,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:48,081 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash 346964984, now seen corresponding path program 1 times [2019-12-27 17:44:48,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:48,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619002797] [2019-12-27 17:44:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:48,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619002797] [2019-12-27 17:44:48,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:48,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:44:48,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1508947442] [2019-12-27 17:44:48,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:48,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:48,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-27 17:44:48,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:48,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:44:48,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:44:48,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:44:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:44:48,444 INFO L87 Difference]: Start difference. First operand 53646 states and 124117 transitions. Second operand 3 states. [2019-12-27 17:44:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:44:48,710 INFO L93 Difference]: Finished difference Result 53646 states and 124116 transitions. [2019-12-27 17:44:48,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:44:48,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-27 17:44:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:44:48,810 INFO L225 Difference]: With dead ends: 53646 [2019-12-27 17:44:48,810 INFO L226 Difference]: Without dead ends: 53646 [2019-12-27 17:44:48,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:44:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53646 states. [2019-12-27 17:44:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53646 to 47983. [2019-12-27 17:44:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47983 states. [2019-12-27 17:44:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47983 states to 47983 states and 111138 transitions. [2019-12-27 17:44:49,912 INFO L78 Accepts]: Start accepts. Automaton has 47983 states and 111138 transitions. Word has length 97 [2019-12-27 17:44:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:44:49,913 INFO L462 AbstractCegarLoop]: Abstraction has 47983 states and 111138 transitions. [2019-12-27 17:44:49,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:44:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47983 states and 111138 transitions. [2019-12-27 17:44:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 17:44:49,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:44:49,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:44:49,959 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:44:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:44:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash -879632529, now seen corresponding path program 2 times [2019-12-27 17:44:49,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:44:49,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347086626] [2019-12-27 17:44:49,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:44:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:44:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:44:50,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347086626] [2019-12-27 17:44:50,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:44:50,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 17:44:50,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817741175] [2019-12-27 17:44:50,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:44:50,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:44:50,656 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 224 transitions. [2019-12-27 17:44:50,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:44:50,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:44:50,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 17:44:50,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:44:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 17:44:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:44:50,864 INFO L87 Difference]: Start difference. First operand 47983 states and 111138 transitions. Second operand 24 states. [2019-12-27 17:44:51,997 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 17:44:54,999 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-27 17:44:55,274 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 17:44:55,436 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 17:44:55,927 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 17:44:57,641 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 17:44:58,265 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 17:44:59,618 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 Received shutdown request... [2019-12-27 17:44:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-27 17:44:59,920 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:44:59,925 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:44:59,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:44:59 BasicIcfg [2019-12-27 17:44:59,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:44:59,927 INFO L168 Benchmark]: Toolchain (without parser) took 222715.69 ms. Allocated memory was 137.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 860.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,927 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.06 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 152.6 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.06 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 148.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,929 INFO L168 Benchmark]: Boogie Preprocessor took 48.46 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 145.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,929 INFO L168 Benchmark]: RCFGBuilder took 1157.69 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 145.3 MB in the beginning and 189.9 MB in the end (delta: -44.6 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,929 INFO L168 Benchmark]: TraceAbstraction took 220561.13 ms. Allocated memory was 233.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 189.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 855.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:44:59,932 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.06 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 152.6 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.06 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 148.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.46 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 145.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1157.69 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 145.3 MB in the beginning and 189.9 MB in the end (delta: -44.6 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220561.13 ms. Allocated memory was 233.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 189.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 855.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.4s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (47983states) and FLOYD_HOARE automaton (currently 73 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (7258 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (47983states) and FLOYD_HOARE automaton (currently 73 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (7258 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 220.3s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 137.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16283 SDtfs, 29668 SDslu, 90508 SDs, 0 SdLazy, 66542 SolverSat, 3124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1428 GetRequests, 272 SyntacticMatches, 63 SemanticMatches, 1093 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67149 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184484occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 313863 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2536 NumberOfCodeBlocks, 2536 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 917023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown