/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-11 20:24:05,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 20:24:05,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 20:24:05,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 20:24:05,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 20:24:05,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 20:24:05,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 20:24:05,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 20:24:05,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 20:24:05,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 20:24:05,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 20:24:05,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 20:24:05,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 20:24:05,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 20:24:05,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 20:24:05,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 20:24:05,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 20:24:05,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 20:24:05,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 20:24:05,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 20:24:05,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 20:24:05,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 20:24:05,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 20:24:05,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 20:24:05,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 20:24:05,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 20:24:05,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 20:24:05,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 20:24:05,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 20:24:05,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 20:24:05,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 20:24:05,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 20:24:05,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 20:24:05,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 20:24:05,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 20:24:05,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 20:24:05,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 20:24:05,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 20:24:05,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 20:24:05,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 20:24:05,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 20:24:05,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-11 20:24:05,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 20:24:05,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 20:24:05,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 20:24:05,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 20:24:05,537 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 20:24:05,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 20:24:05,537 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 20:24:05,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 20:24:05,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 20:24:05,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 20:24:05,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 20:24:05,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 20:24:05,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 20:24:05,540 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 20:24:05,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 20:24:05,541 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 20:24:05,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 20:24:05,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 20:24:05,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 20:24:05,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 20:24:05,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 20:24:05,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 20:24:05,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 20:24:05,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-11 20:24:05,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 20:24:05,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 20:24:05,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 20:24:05,543 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-11 20:24:05,543 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-11 20:24:05,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 20:24:05,544 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-11 20:24:05,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 20:24:06,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 20:24:06,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 20:24:06,024 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 20:24:06,025 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 20:24:06,026 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-11 20:24:06,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/da795723d/665913c8d5244bbd96ff33f838e9785d/FLAGf5097f0d6 [2020-09-11 20:24:06,779 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 20:24:06,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-11 20:24:06,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/da795723d/665913c8d5244bbd96ff33f838e9785d/FLAGf5097f0d6 [2020-09-11 20:24:07,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/da795723d/665913c8d5244bbd96ff33f838e9785d [2020-09-11 20:24:07,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 20:24:07,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 20:24:07,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 20:24:07,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 20:24:07,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 20:24:07,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:07" (1/1) ... [2020-09-11 20:24:07,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52250798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:07, skipping insertion in model container [2020-09-11 20:24:07,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:07" (1/1) ... [2020-09-11 20:24:07,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 20:24:07,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 20:24:07,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 20:24:07,958 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 20:24:08,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 20:24:08,198 INFO L208 MainTranslator]: Completed translation [2020-09-11 20:24:08,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08 WrapperNode [2020-09-11 20:24:08,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 20:24:08,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 20:24:08,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 20:24:08,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 20:24:08,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 20:24:08,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 20:24:08,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 20:24:08,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 20:24:08,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... [2020-09-11 20:24:08,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 20:24:08,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 20:24:08,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 20:24:08,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 20:24:08,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-11 20:24:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-09-11 20:24:08,428 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-09-11 20:24:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-09-11 20:24:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-09-11 20:24:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 20:24:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 20:24:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-11 20:24:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 20:24:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-11 20:24:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-11 20:24:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 20:24:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 20:24:08,433 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 20:24:08,992 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 20:24:08,992 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-11 20:24:08,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:08 BoogieIcfgContainer [2020-09-11 20:24:08,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 20:24:08,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 20:24:08,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 20:24:09,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 20:24:09,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:24:07" (1/3) ... [2020-09-11 20:24:09,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494ec21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:09, skipping insertion in model container [2020-09-11 20:24:09,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:08" (2/3) ... [2020-09-11 20:24:09,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494ec21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:09, skipping insertion in model container [2020-09-11 20:24:09,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:08" (3/3) ... [2020-09-11 20:24:09,007 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-09-11 20:24:09,019 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 20:24:09,019 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-11 20:24:09,031 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-09-11 20:24:09,032 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 20:24:09,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,094 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,094 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,094 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,096 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,096 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,096 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,096 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,096 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,097 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,097 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,097 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,097 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,098 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,098 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,098 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,098 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,098 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,099 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,101 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,101 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,101 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,101 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,101 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,104 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,104 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,104 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,104 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,104 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,105 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,105 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,105 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,105 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,106 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,106 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,106 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,106 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,107 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,107 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,107 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,107 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,109 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,110 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,110 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,110 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,110 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,111 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,111 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,111 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,111 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,111 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,112 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,112 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,112 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,113 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,113 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,113 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,113 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,114 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,115 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,115 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,115 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,115 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,115 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,116 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,116 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,116 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,116 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,117 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,117 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,117 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,117 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,118 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,118 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,118 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,118 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,119 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,119 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,119 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,119 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,120 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,120 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,120 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,120 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,121 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,127 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,128 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,128 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,129 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,129 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,130 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,130 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,140 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,140 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,140 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,141 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,142 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,142 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,142 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,142 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,142 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,143 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,143 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,143 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,143 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,143 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:24:09,178 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-11 20:24:09,207 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:24:09,207 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:24:09,207 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:24:09,207 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-11 20:24:09,207 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:24:09,207 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:24:09,207 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:24:09,208 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:24:09,230 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-09-11 20:24:09,233 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-11 20:24:09,316 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-11 20:24:09,316 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 20:24:09,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-09-11 20:24:09,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-11 20:24:09,367 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-11 20:24:09,367 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 20:24:09,370 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-09-11 20:24:09,375 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5744 [2020-09-11 20:24:09,377 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:24:11,246 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-09-11 20:24:12,602 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-09-11 20:24:12,842 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-11 20:24:13,224 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-09-11 20:24:13,459 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-11 20:24:13,472 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7699 [2020-09-11 20:24:13,473 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2020-09-11 20:24:13,477 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-09-11 20:24:13,504 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-09-11 20:24:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-09-11 20:24:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-09-11 20:24:13,515 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:13,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-09-11 20:24:13,517 INFO L427 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-09-11 20:24:13,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:13,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225490134] [2020-09-11 20:24:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:13,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225490134] [2020-09-11 20:24:13,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:13,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 20:24:13,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375913729] [2020-09-11 20:24:13,840 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:13,846 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:13,865 INFO L274 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-09-11 20:24:13,865 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:13,867 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:24:13,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:24:13,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:13,892 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-09-11 20:24:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:14,019 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-09-11 20:24:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:24:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-09-11 20:24:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:14,045 INFO L225 Difference]: With dead ends: 504 [2020-09-11 20:24:14,045 INFO L226 Difference]: Without dead ends: 460 [2020-09-11 20:24:14,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-11 20:24:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-09-11 20:24:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-09-11 20:24:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-09-11 20:24:14,141 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-09-11 20:24:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:14,142 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-09-11 20:24:14,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:24:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-09-11 20:24:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-11 20:24:14,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:14,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:14,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 20:24:14,145 INFO L427 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-09-11 20:24:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:14,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881393700] [2020-09-11 20:24:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:14,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881393700] [2020-09-11 20:24:14,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:14,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 20:24:14,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038026369] [2020-09-11 20:24:14,290 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:14,296 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:14,299 INFO L274 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-09-11 20:24:14,299 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:14,300 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:14,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:24:14,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:24:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:14,302 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-09-11 20:24:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:14,331 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-09-11 20:24:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:24:14,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-11 20:24:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:14,340 INFO L225 Difference]: With dead ends: 464 [2020-09-11 20:24:14,340 INFO L226 Difference]: Without dead ends: 464 [2020-09-11 20:24:14,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-11 20:24:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-09-11 20:24:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-09-11 20:24:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-09-11 20:24:14,381 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-09-11 20:24:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:14,381 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-09-11 20:24:14,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:24:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-09-11 20:24:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:24:14,383 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:14,383 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:14,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 20:24:14,384 INFO L427 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-09-11 20:24:14,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:14,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641532861] [2020-09-11 20:24:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:14,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641532861] [2020-09-11 20:24:14,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479337788] [2020-09-11 20:24:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:14,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-11 20:24:14,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:14,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:24:14,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-09-11 20:24:14,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300178802] [2020-09-11 20:24:14,761 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:14,764 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:14,766 INFO L274 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-09-11 20:24:14,766 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:14,767 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:14,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:24:14,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:24:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:24:14,769 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 7 states. [2020-09-11 20:24:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:14,925 INFO L93 Difference]: Finished difference Result 866 states and 2152 transitions. [2020-09-11 20:24:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 20:24:14,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-09-11 20:24:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:14,932 INFO L225 Difference]: With dead ends: 866 [2020-09-11 20:24:14,933 INFO L226 Difference]: Without dead ends: 851 [2020-09-11 20:24:14,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:24:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-09-11 20:24:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 575. [2020-09-11 20:24:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-09-11 20:24:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1484 transitions. [2020-09-11 20:24:14,961 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1484 transitions. Word has length 13 [2020-09-11 20:24:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:14,962 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 1484 transitions. [2020-09-11 20:24:14,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:24:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1484 transitions. [2020-09-11 20:24:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-11 20:24:14,965 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:14,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:15,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-11 20:24:15,178 INFO L427 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-09-11 20:24:15,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:15,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237781624] [2020-09-11 20:24:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:15,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237781624] [2020-09-11 20:24:15,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:15,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:24:15,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685945900] [2020-09-11 20:24:15,261 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:15,263 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:15,269 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-09-11 20:24:15,269 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:15,326 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:15,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:24:15,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:15,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:24:15,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:15,327 INFO L87 Difference]: Start difference. First operand 575 states and 1484 transitions. Second operand 3 states. [2020-09-11 20:24:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:15,367 INFO L93 Difference]: Finished difference Result 304 states and 670 transitions. [2020-09-11 20:24:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:24:15,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-11 20:24:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:15,377 INFO L225 Difference]: With dead ends: 304 [2020-09-11 20:24:15,377 INFO L226 Difference]: Without dead ends: 304 [2020-09-11 20:24:15,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:24:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-11 20:24:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2020-09-11 20:24:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-09-11 20:24:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 643 transitions. [2020-09-11 20:24:15,398 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 643 transitions. Word has length 16 [2020-09-11 20:24:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:15,399 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 643 transitions. [2020-09-11 20:24:15,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:24:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 643 transitions. [2020-09-11 20:24:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 20:24:15,404 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:15,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:15,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 20:24:15,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:15,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-09-11 20:24:15,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:15,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127107974] [2020-09-11 20:24:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:15,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127107974] [2020-09-11 20:24:15,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:15,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-11 20:24:15,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [659676381] [2020-09-11 20:24:15,541 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:15,543 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:15,548 INFO L274 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-09-11 20:24:15,548 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:15,619 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6503#(< 0 (+ |t1Thread1of1ForFork0_inc_top_#t~post30| 1)), 6504#(< 0 (+ ~top~0 1))] [2020-09-11 20:24:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:24:15,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:24:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:24:15,621 INFO L87 Difference]: Start difference. First operand 294 states and 643 transitions. Second operand 7 states. [2020-09-11 20:24:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:15,724 INFO L93 Difference]: Finished difference Result 415 states and 890 transitions. [2020-09-11 20:24:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:24:15,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-09-11 20:24:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:15,727 INFO L225 Difference]: With dead ends: 415 [2020-09-11 20:24:15,728 INFO L226 Difference]: Without dead ends: 415 [2020-09-11 20:24:15,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:24:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-09-11 20:24:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2020-09-11 20:24:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-09-11 20:24:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 723 transitions. [2020-09-11 20:24:15,740 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 723 transitions. Word has length 17 [2020-09-11 20:24:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:15,741 INFO L479 AbstractCegarLoop]: Abstraction has 325 states and 723 transitions. [2020-09-11 20:24:15,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:24:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 723 transitions. [2020-09-11 20:24:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 20:24:15,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:15,743 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-09-11 20:24:15,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 20:24:15,744 INFO L427 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-09-11 20:24:15,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:15,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159290270] [2020-09-11 20:24:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:15,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159290270] [2020-09-11 20:24:15,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839137387] [2020-09-11 20:24:15,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:15,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:24:15,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:24:15,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 20:24:15,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:16,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:24:16,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-09-11 20:24:16,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [304610806] [2020-09-11 20:24:16,005 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:16,010 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:16,014 INFO L274 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-09-11 20:24:16,015 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:16,015 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:16,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:24:16,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:24:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:24:16,016 INFO L87 Difference]: Start difference. First operand 325 states and 723 transitions. Second operand 9 states. [2020-09-11 20:24:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:16,133 INFO L93 Difference]: Finished difference Result 582 states and 1263 transitions. [2020-09-11 20:24:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 20:24:16,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-11 20:24:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:16,138 INFO L225 Difference]: With dead ends: 582 [2020-09-11 20:24:16,139 INFO L226 Difference]: Without dead ends: 582 [2020-09-11 20:24:16,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:24:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-09-11 20:24:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2020-09-11 20:24:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-09-11 20:24:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 931 transitions. [2020-09-11 20:24:16,155 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 931 transitions. Word has length 20 [2020-09-11 20:24:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:16,155 INFO L479 AbstractCegarLoop]: Abstraction has 416 states and 931 transitions. [2020-09-11 20:24:16,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:24:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 931 transitions. [2020-09-11 20:24:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:24:16,157 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:16,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:16,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:16,372 INFO L427 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-09-11 20:24:16,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:16,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709852028] [2020-09-11 20:24:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:16,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709852028] [2020-09-11 20:24:16,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:24:16,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648118407] [2020-09-11 20:24:16,824 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:16,827 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:16,833 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-09-11 20:24:16,833 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:16,881 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:16,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:24:16,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:24:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:24:16,883 INFO L87 Difference]: Start difference. First operand 416 states and 931 transitions. Second operand 9 states. [2020-09-11 20:24:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:17,164 INFO L93 Difference]: Finished difference Result 635 states and 1377 transitions. [2020-09-11 20:24:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 20:24:17,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:24:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:17,169 INFO L225 Difference]: With dead ends: 635 [2020-09-11 20:24:17,169 INFO L226 Difference]: Without dead ends: 573 [2020-09-11 20:24:17,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:24:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-09-11 20:24:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 442. [2020-09-11 20:24:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-09-11 20:24:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 986 transitions. [2020-09-11 20:24:17,185 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 986 transitions. Word has length 21 [2020-09-11 20:24:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:17,185 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 986 transitions. [2020-09-11 20:24:17,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:24:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 986 transitions. [2020-09-11 20:24:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 20:24:17,187 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:17,187 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:17,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 20:24:17,188 INFO L427 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-09-11 20:24:17,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:17,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755600301] [2020-09-11 20:24:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:17,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755600301] [2020-09-11 20:24:17,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274319377] [2020-09-11 20:24:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:17,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 20:24:17,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:24:17,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-11 20:24:17,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-09-11 20:24:17,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953499497] [2020-09-11 20:24:17,458 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:17,462 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:17,470 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-09-11 20:24:17,471 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:17,522 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:17,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 20:24:17,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 20:24:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-11 20:24:17,524 INFO L87 Difference]: Start difference. First operand 442 states and 986 transitions. Second operand 6 states. [2020-09-11 20:24:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:17,611 INFO L93 Difference]: Finished difference Result 600 states and 1292 transitions. [2020-09-11 20:24:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:24:17,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-11 20:24:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:17,616 INFO L225 Difference]: With dead ends: 600 [2020-09-11 20:24:17,616 INFO L226 Difference]: Without dead ends: 590 [2020-09-11 20:24:17,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-11 20:24:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-11 20:24:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2020-09-11 20:24:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-09-11 20:24:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1103 transitions. [2020-09-11 20:24:17,632 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1103 transitions. Word has length 24 [2020-09-11 20:24:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:17,633 INFO L479 AbstractCegarLoop]: Abstraction has 500 states and 1103 transitions. [2020-09-11 20:24:17,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 20:24:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1103 transitions. [2020-09-11 20:24:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-11 20:24:17,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:17,635 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-09-11 20:24:17,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:17,848 INFO L427 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-09-11 20:24:17,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:17,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162119402] [2020-09-11 20:24:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:17,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162119402] [2020-09-11 20:24:17,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310693225] [2020-09-11 20:24:17,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:18,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-11 20:24:18,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:24:18,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 20:24:18,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:18,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:24:18,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-09-11 20:24:18,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145991237] [2020-09-11 20:24:18,210 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:18,219 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:18,233 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-09-11 20:24:18,233 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:18,234 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 20:24:18,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 20:24:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-11 20:24:18,235 INFO L87 Difference]: Start difference. First operand 500 states and 1103 transitions. Second operand 11 states. [2020-09-11 20:24:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:18,381 INFO L93 Difference]: Finished difference Result 839 states and 1799 transitions. [2020-09-11 20:24:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 20:24:18,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-09-11 20:24:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:18,387 INFO L225 Difference]: With dead ends: 839 [2020-09-11 20:24:18,387 INFO L226 Difference]: Without dead ends: 839 [2020-09-11 20:24:18,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-11 20:24:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-09-11 20:24:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 591. [2020-09-11 20:24:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-11 20:24:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1311 transitions. [2020-09-11 20:24:18,410 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1311 transitions. Word has length 27 [2020-09-11 20:24:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:18,411 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1311 transitions. [2020-09-11 20:24:18,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 20:24:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1311 transitions. [2020-09-11 20:24:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-11 20:24:18,412 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:18,413 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:18,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:18,628 INFO L427 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-09-11 20:24:18,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:18,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117621423] [2020-09-11 20:24:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-11 20:24:19,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117621423] [2020-09-11 20:24:19,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:24:19,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-11 20:24:19,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306294006] [2020-09-11 20:24:19,119 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:19,124 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:19,134 INFO L274 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-09-11 20:24:19,134 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:19,233 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14408#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4))) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4)) 399)), 14409#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |~#arr~0.offset| 0))] [2020-09-11 20:24:19,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-11 20:24:19,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-11 20:24:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-09-11 20:24:19,235 INFO L87 Difference]: Start difference. First operand 591 states and 1311 transitions. Second operand 17 states. [2020-09-11 20:24:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:21,369 INFO L93 Difference]: Finished difference Result 946 states and 2054 transitions. [2020-09-11 20:24:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-11 20:24:21,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-09-11 20:24:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:21,374 INFO L225 Difference]: With dead ends: 946 [2020-09-11 20:24:21,375 INFO L226 Difference]: Without dead ends: 906 [2020-09-11 20:24:21,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:24:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-11 20:24:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 605. [2020-09-11 20:24:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-09-11 20:24:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1354 transitions. [2020-09-11 20:24:21,396 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1354 transitions. Word has length 28 [2020-09-11 20:24:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:21,397 INFO L479 AbstractCegarLoop]: Abstraction has 605 states and 1354 transitions. [2020-09-11 20:24:21,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-11 20:24:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1354 transitions. [2020-09-11 20:24:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-11 20:24:21,399 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:21,399 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:21,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 20:24:21,400 INFO L427 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-09-11 20:24:21,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:21,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464219069] [2020-09-11 20:24:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:24:21,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464219069] [2020-09-11 20:24:21,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675106939] [2020-09-11 20:24:21,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:21,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:24:21,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:24:21,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 20:24:21,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:24:21,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:24:21,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 20:24:21,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059860078] [2020-09-11 20:24:21,696 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:21,702 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:21,717 INFO L274 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-09-11 20:24:21,717 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:21,773 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:21,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 20:24:21,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 20:24:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-11 20:24:21,775 INFO L87 Difference]: Start difference. First operand 605 states and 1354 transitions. Second operand 10 states. [2020-09-11 20:24:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:21,925 INFO L93 Difference]: Finished difference Result 907 states and 1949 transitions. [2020-09-11 20:24:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 20:24:21,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-11 20:24:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:21,930 INFO L225 Difference]: With dead ends: 907 [2020-09-11 20:24:21,930 INFO L226 Difference]: Without dead ends: 907 [2020-09-11 20:24:21,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-09-11 20:24:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-09-11 20:24:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 651. [2020-09-11 20:24:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2020-09-11 20:24:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1483 transitions. [2020-09-11 20:24:21,950 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1483 transitions. Word has length 31 [2020-09-11 20:24:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:21,950 INFO L479 AbstractCegarLoop]: Abstraction has 651 states and 1483 transitions. [2020-09-11 20:24:21,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 20:24:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1483 transitions. [2020-09-11 20:24:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-11 20:24:21,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:21,952 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-09-11 20:24:22,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-11 20:24:22,165 INFO L427 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-09-11 20:24:22,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:22,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136088564] [2020-09-11 20:24:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:22,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136088564] [2020-09-11 20:24:22,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925152887] [2020-09-11 20:24:22,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:22,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:24:22,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:24:22,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-11 20:24:22,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:22,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:24:22,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-09-11 20:24:22,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186446270] [2020-09-11 20:24:22,478 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-11 20:24:22,486 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-11 20:24:22,496 INFO L274 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-09-11 20:24:22,497 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-11 20:24:22,497 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-11 20:24:22,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-11 20:24:22,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:24:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-11 20:24:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-09-11 20:24:22,499 INFO L87 Difference]: Start difference. First operand 651 states and 1483 transitions. Second operand 13 states. [2020-09-11 20:24:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:24:22,706 INFO L93 Difference]: Finished difference Result 1005 states and 2204 transitions. [2020-09-11 20:24:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:24:22,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-09-11 20:24:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:24:22,713 INFO L225 Difference]: With dead ends: 1005 [2020-09-11 20:24:22,713 INFO L226 Difference]: Without dead ends: 1005 [2020-09-11 20:24:22,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2020-09-11 20:24:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2020-09-11 20:24:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 742. [2020-09-11 20:24:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2020-09-11 20:24:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1691 transitions. [2020-09-11 20:24:22,739 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1691 transitions. Word has length 34 [2020-09-11 20:24:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:24:22,740 INFO L479 AbstractCegarLoop]: Abstraction has 742 states and 1691 transitions. [2020-09-11 20:24:22,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-11 20:24:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1691 transitions. [2020-09-11 20:24:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-11 20:24:22,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:24:22,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:24:22,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:22,958 INFO L427 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:24:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:24:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-09-11 20:24:22,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:24:22,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539474694] [2020-09-11 20:24:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:24:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:24:23,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539474694] [2020-09-11 20:24:23,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039844830] [2020-09-11 20:24:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:24:23,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2020-09-11 20:24:23,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:24:24,083 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 20:24:24,084 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 260 [2020-09-11 20:24:24,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-11 20:24:24,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-11 20:24:24,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-09-11 20:24:24,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-09-11 20:24:24,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-09-11 20:24:24,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-11 20:24:24,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-11 20:24:24,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-09-11 20:24:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-11 20:24:24,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-09-11 20:24:24,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-11 20:24:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-09-11 20:24:24,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-09-11 20:24:24,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-09-11 20:24:24,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-09-11 20:24:24,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-11 20:24:24,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-09-11 20:24:24,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-11 20:24:24,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-11 20:24:24,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-11 20:24:24,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-11 20:24:24,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-11 20:24:24,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-11 20:24:24,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,152 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-11 20:24:24,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-11 20:24:24,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-11 20:24:24,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-11 20:24:24,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-11 20:24:24,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,236 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,261 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-11 20:24:24,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-11 20:24:24,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-11 20:24:24,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-11 20:24:24,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-11 20:24:24,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-11 20:24:24,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-11 20:24:24,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-11 20:24:24,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-11 20:24:24,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-11 20:24:24,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-11 20:24:24,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,306 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,313 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,319 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-11 20:24:24,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,329 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,333 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,334 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,338 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,345 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,359 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,361 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,372 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,377 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-11 20:24:24,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-11 20:24:24,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-11 20:24:24,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-11 20:24:24,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-11 20:24:24,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-11 20:24:24,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-11 20:24:24,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-11 20:24:24,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,413 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,419 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-11 20:24:24,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-11 20:24:24,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-11 20:24:24,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-11 20:24:24,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-11 20:24:24,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-11 20:24:24,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-11 20:24:24,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-11 20:24:24,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-11 20:24:24,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,434 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-11 20:24:24,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-11 20:24:24,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-11 20:24:24,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-11 20:24:24,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-11 20:24:24,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-11 20:24:24,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-11 20:24:24,439 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-11 20:24:24,446 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-11 20:24:25,189 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-09-11 20:24:25,190 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-09-11 20:24:25,202 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-09-11 20:24:25,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:24:25,404 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: need array sort at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.binaryEquality(SmtUtils.java:663) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatusViaSolver(ArrayIndexEqualityManager.java:150) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatus(ArrayIndexEqualityManager.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:617) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:409) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:295) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:602) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:515) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:309) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:105) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-09-11 20:24:25,409 INFO L168 Benchmark]: Toolchain (without parser) took 18356.63 ms. Allocated memory was 141.6 MB in the beginning and 393.2 MB in the end (delta: 251.7 MB). Free memory was 103.0 MB in the beginning and 341.7 MB in the end (delta: -238.7 MB). Peak memory consumption was 263.4 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,414 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-11 20:24:25,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1140.64 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 136.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.35 ms. Allocated memory is still 205.0 MB. Free memory was 136.6 MB in the beginning and 133.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,416 INFO L168 Benchmark]: Boogie Preprocessor took 43.68 ms. Allocated memory is still 205.0 MB. Free memory was 133.9 MB in the beginning and 132.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,416 INFO L168 Benchmark]: RCFGBuilder took 658.97 ms. Allocated memory is still 205.0 MB. Free memory was 132.0 MB in the beginning and 99.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,417 INFO L168 Benchmark]: TraceAbstraction took 16408.53 ms. Allocated memory was 205.0 MB in the beginning and 393.2 MB in the end (delta: 188.2 MB). Free memory was 99.1 MB in the beginning and 341.7 MB in the end (delta: -242.6 MB). Peak memory consumption was 196.1 MB. Max. memory is 7.1 GB. [2020-09-11 20:24:25,420 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1140.64 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 136.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.35 ms. Allocated memory is still 205.0 MB. Free memory was 136.6 MB in the beginning and 133.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.68 ms. Allocated memory is still 205.0 MB. Free memory was 133.9 MB in the beginning and 132.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 658.97 ms. Allocated memory is still 205.0 MB. Free memory was 132.0 MB in the beginning and 99.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16408.53 ms. Allocated memory was 205.0 MB in the beginning and 393.2 MB in the end (delta: 188.2 MB). Free memory was 99.1 MB in the beginning and 341.7 MB in the end (delta: -242.6 MB). Peak memory consumption was 196.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 133 ProgramPointsBefore, 40 ProgramPointsAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 5744 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 3038 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7699 CheckedPairsTotal, 118 TotalNumberOfCompositions - ExceptionOrErrorResult: UnsupportedOperationException: need array sort de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: need array sort: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...