/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_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-bf4350c [2020-09-17 14:53:27,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-17 14:53:27,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-17 14:53:27,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-17 14:53:27,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-17 14:53:27,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-17 14:53:27,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-17 14:53:27,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-17 14:53:27,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-17 14:53:27,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-17 14:53:27,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-17 14:53:27,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-17 14:53:27,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-17 14:53:27,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-17 14:53:27,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-17 14:53:27,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-17 14:53:27,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-17 14:53:27,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-17 14:53:27,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-17 14:53:27,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-17 14:53:27,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-17 14:53:27,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-17 14:53:27,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-17 14:53:27,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-17 14:53:27,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-17 14:53:27,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-17 14:53:27,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-17 14:53:27,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-17 14:53:27,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-17 14:53:27,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-17 14:53:27,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-17 14:53:27,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-17 14:53:27,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-17 14:53:27,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-17 14:53:27,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-17 14:53:27,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-17 14:53:27,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-17 14:53:27,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-17 14:53:27,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-17 14:53:27,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-17 14:53:27,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-17 14:53:27,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-17 14:53:27,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-17 14:53:27,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-17 14:53:27,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-17 14:53:27,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-17 14:53:27,665 INFO L138 SettingsManager]: * Use SBE=true [2020-09-17 14:53:27,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-17 14:53:27,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-17 14:53:27,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-17 14:53:27,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-17 14:53:27,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-17 14:53:27,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-17 14:53:27,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-17 14:53:27,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-17 14:53:27,668 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-17 14:53:27,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-17 14:53:27,668 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-17 14:53:27,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-17 14:53:27,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-17 14:53:27,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-17 14:53:27,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-17 14:53:27,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-17 14:53:27,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-17 14:53:27,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-17 14:53:27,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-17 14:53:27,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-17 14:53:27,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-17 14:53:27,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-17 14:53:27,671 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-17 14:53:27,671 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-17 14:53:27,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-17 14:53:27,671 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-17 14:53:28,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-17 14:53:28,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-17 14:53:28,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-17 14:53:28,163 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-17 14:53:28,164 INFO L275 PluginConnector]: CDTParser initialized [2020-09-17 14:53:28,165 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2020-09-17 14:53:28,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0637db/3f355abd95604788b481db926bfe267c/FLAG3df9c8357 [2020-09-17 14:53:28,914 INFO L306 CDTParser]: Found 1 translation units. [2020-09-17 14:53:28,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2020-09-17 14:53:28,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0637db/3f355abd95604788b481db926bfe267c/FLAG3df9c8357 [2020-09-17 14:53:29,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0637db/3f355abd95604788b481db926bfe267c [2020-09-17 14:53:29,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-17 14:53:29,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-17 14:53:29,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-17 14:53:29,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-17 14:53:29,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-17 14:53:29,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 02:53:29" (1/1) ... [2020-09-17 14:53:29,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e118629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:29, skipping insertion in model container [2020-09-17 14:53:29,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 02:53:29" (1/1) ... [2020-09-17 14:53:29,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-17 14:53:29,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-17 14:53:29,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 14:53:29,961 INFO L203 MainTranslator]: Completed pre-run [2020-09-17 14:53:30,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 14:53:30,173 INFO L208 MainTranslator]: Completed translation [2020-09-17 14:53:30,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30 WrapperNode [2020-09-17 14:53:30,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-17 14:53:30,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-17 14:53:30,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-17 14:53:30,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-17 14:53:30,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-17 14:53:30,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-17 14:53:30,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-17 14:53:30,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-17 14:53:30,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... [2020-09-17 14:53:30,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-17 14:53:30,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-17 14:53:30,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-17 14:53:30,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-17 14:53:30,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-17 14:53:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-09-17 14:53:30,375 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-09-17 14:53:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-09-17 14:53:30,375 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-09-17 14:53:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-17 14:53:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-17 14:53:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-17 14:53:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-17 14:53:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-17 14:53:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-17 14:53:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-17 14:53:30,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-17 14:53:30,382 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-17 14:53:30,921 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-17 14:53:30,922 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-17 14:53:30,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 02:53:30 BoogieIcfgContainer [2020-09-17 14:53:30,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-17 14:53:30,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-17 14:53:30,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-17 14:53:30,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-17 14:53:30,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 02:53:29" (1/3) ... [2020-09-17 14:53:30,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ae2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 02:53:30, skipping insertion in model container [2020-09-17 14:53:30,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:30" (2/3) ... [2020-09-17 14:53:30,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ae2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 02:53:30, skipping insertion in model container [2020-09-17 14:53:30,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 02:53:30" (3/3) ... [2020-09-17 14:53:30,937 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2020-09-17 14:53:30,948 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-17 14:53:30,949 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-17 14:53:30,960 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-09-17 14:53:30,962 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-17 14:53:30,998 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,998 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,998 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,998 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,999 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,999 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:30,999 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,000 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,000 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,001 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,002 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,002 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,002 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,002 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,003 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,003 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,003 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,003 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,004 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,004 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,004 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,004 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,005 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,005 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,005 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,006 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,006 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,006 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,006 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,006 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,007 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,007 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,007 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,007 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,008 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,008 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,008 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,009 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,009 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,009 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,009 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,010 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,010 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,010 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,011 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,011 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,011 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,011 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,012 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,012 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,012 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,012 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,013 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,013 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,013 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,014 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,014 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,014 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,015 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,015 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,015 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,015 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,016 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,017 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,017 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,017 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,018 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,018 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,018 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,018 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,019 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,019 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,019 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,020 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,020 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,020 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,021 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,021 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,021 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,021 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,022 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,022 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,022 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,022 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,023 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,023 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,023 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,024 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,024 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,024 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,024 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,040 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,040 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,041 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,041 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,041 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,041 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,042 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,042 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,042 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,042 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,043 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,043 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,043 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,043 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,044 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,044 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,044 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,044 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,045 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,045 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,045 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,045 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,045 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,046 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,046 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,046 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,046 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,051 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,051 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,051 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,052 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,052 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,052 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,052 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,053 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,053 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,053 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,053 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,053 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,054 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,055 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,055 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,055 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,055 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,055 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,066 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,066 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,066 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,067 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,067 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,067 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,067 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,067 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,068 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,068 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,068 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,068 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,068 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,069 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,069 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,069 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,069 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,070 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:31,099 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-17 14:53:31,128 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-17 14:53:31,128 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-17 14:53:31,128 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-17 14:53:31,128 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-17 14:53:31,128 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-17 14:53:31,128 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-17 14:53:31,129 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-17 14:53:31,129 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-17 14:53:31,150 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:31,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:31,241 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-17 14:53:31,242 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 14:53:31,249 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-17 14:53:31,257 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:31,289 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-17 14:53:31,289 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 14:53:31,291 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-17 14:53:31,298 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5744 [2020-09-17 14:53:31,301 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-17 14:53:32,972 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-09-17 14:53:34,212 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-09-17 14:53:34,444 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-17 14:53:34,577 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-09-17 14:53:34,898 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-09-17 14:53:35,132 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-17 14:53:35,145 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7699 [2020-09-17 14:53:35,145 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2020-09-17 14:53:35,150 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-09-17 14:53:35,178 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-09-17 14:53:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-09-17 14:53:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-09-17 14:53:35,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:35,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-09-17 14:53:35,191 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-17 14:53:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-09-17 14:53:35,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:35,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718084635] [2020-09-17 14:53:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:35,486 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-17 14:53:35,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718084635] [2020-09-17 14:53:35,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:35,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 14:53:35,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114044802] [2020-09-17 14:53:35,490 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:35,493 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:35,509 INFO L274 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-09-17 14:53:35,509 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:35,511 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:35,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:35,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:35,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:35,528 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-09-17 14:53:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:35,639 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-09-17 14:53:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:35,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-09-17 14:53:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:35,684 INFO L225 Difference]: With dead ends: 504 [2020-09-17 14:53:35,685 INFO L226 Difference]: Without dead ends: 460 [2020-09-17 14:53:35,687 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-17 14:53:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-17 14:53:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-09-17 14:53:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-09-17 14:53:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-09-17 14:53:35,795 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-09-17 14:53:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:35,795 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-09-17 14:53:35,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-09-17 14:53:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-17 14:53:35,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:35,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:35,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-17 14:53:35,798 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-17 14:53:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-09-17 14:53:35,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:35,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637498854] [2020-09-17 14:53:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:35,897 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-17 14:53:35,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637498854] [2020-09-17 14:53:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 14:53:35,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217258956] [2020-09-17 14:53:35,899 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:35,900 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:35,902 INFO L274 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-09-17 14:53:35,902 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:35,902 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:35,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:35,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:35,905 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-09-17 14:53:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:35,925 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-09-17 14:53:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:35,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-17 14:53:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:35,930 INFO L225 Difference]: With dead ends: 464 [2020-09-17 14:53:35,931 INFO L226 Difference]: Without dead ends: 464 [2020-09-17 14:53:35,932 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-17 14:53:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-17 14:53:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-09-17 14:53:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-09-17 14:53:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-09-17 14:53:35,962 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-09-17 14:53:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:35,963 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-09-17 14:53:35,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-09-17 14:53:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-17 14:53:35,965 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:35,965 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:35,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-17 14:53:35,965 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-17 14:53:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:35,966 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-09-17 14:53:35,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:35,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099146883] [2020-09-17 14:53:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:36,120 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-17 14:53:36,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099146883] [2020-09-17 14:53:36,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492258594] [2020-09-17 14:53:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:36,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-17 14:53:36,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:36,260 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-17 14:53:36,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:36,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-09-17 14:53:36,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294750263] [2020-09-17 14:53:36,262 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:36,264 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:36,266 INFO L274 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-09-17 14:53:36,266 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:36,266 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:36,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 14:53:36,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 14:53:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-17 14:53:36,267 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 7 states. [2020-09-17 14:53:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:36,387 INFO L93 Difference]: Finished difference Result 866 states and 2152 transitions. [2020-09-17 14:53:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-17 14:53:36,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-09-17 14:53:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:36,393 INFO L225 Difference]: With dead ends: 866 [2020-09-17 14:53:36,394 INFO L226 Difference]: Without dead ends: 851 [2020-09-17 14:53:36,394 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-17 14:53:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-09-17 14:53:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 575. [2020-09-17 14:53:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-09-17 14:53:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1484 transitions. [2020-09-17 14:53:36,427 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1484 transitions. Word has length 13 [2020-09-17 14:53:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:36,427 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 1484 transitions. [2020-09-17 14:53:36,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 14:53:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1484 transitions. [2020-09-17 14:53:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-17 14:53:36,430 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:36,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:36,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-17 14:53:36,644 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-17 14:53:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-09-17 14:53:36,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:36,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780424048] [2020-09-17 14:53:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:36,727 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-17 14:53:36,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780424048] [2020-09-17 14:53:36,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:36,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-17 14:53:36,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [488595554] [2020-09-17 14:53:36,729 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:36,732 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:36,736 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-09-17 14:53:36,736 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:36,775 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:36,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:36,777 INFO L87 Difference]: Start difference. First operand 575 states and 1484 transitions. Second operand 3 states. [2020-09-17 14:53:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:36,798 INFO L93 Difference]: Finished difference Result 304 states and 670 transitions. [2020-09-17 14:53:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:36,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-17 14:53:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:36,801 INFO L225 Difference]: With dead ends: 304 [2020-09-17 14:53:36,802 INFO L226 Difference]: Without dead ends: 304 [2020-09-17 14:53:36,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-17 14:53:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2020-09-17 14:53:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-09-17 14:53:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 643 transitions. [2020-09-17 14:53:36,812 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 643 transitions. Word has length 16 [2020-09-17 14:53:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:36,812 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 643 transitions. [2020-09-17 14:53:36,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 643 transitions. [2020-09-17 14:53:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-17 14:53:36,815 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:36,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:36,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-17 14:53:36,816 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-17 14:53:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:36,816 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-09-17 14:53:36,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:36,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400948415] [2020-09-17 14:53:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:36,943 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-17 14:53:36,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400948415] [2020-09-17 14:53:36,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:36,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-17 14:53:36,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097092618] [2020-09-17 14:53:36,945 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:36,948 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:36,954 INFO L274 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-09-17 14:53:36,954 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:37,016 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6503#(< 0 (+ |t1Thread1of1ForFork0_inc_top_#t~post30| 1)), 6504#(< 0 (+ ~top~0 1))] [2020-09-17 14:53:37,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 14:53:37,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 14:53:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-17 14:53:37,018 INFO L87 Difference]: Start difference. First operand 294 states and 643 transitions. Second operand 7 states. [2020-09-17 14:53:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:37,153 INFO L93 Difference]: Finished difference Result 415 states and 890 transitions. [2020-09-17 14:53:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-17 14:53:37,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-09-17 14:53:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:37,161 INFO L225 Difference]: With dead ends: 415 [2020-09-17 14:53:37,161 INFO L226 Difference]: Without dead ends: 415 [2020-09-17 14:53:37,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-17 14:53:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-09-17 14:53:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2020-09-17 14:53:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-09-17 14:53:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 723 transitions. [2020-09-17 14:53:37,175 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 723 transitions. Word has length 17 [2020-09-17 14:53:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:37,177 INFO L479 AbstractCegarLoop]: Abstraction has 325 states and 723 transitions. [2020-09-17 14:53:37,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 14:53:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 723 transitions. [2020-09-17 14:53:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-17 14:53:37,186 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:37,186 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-09-17 14:53:37,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-17 14:53:37,187 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-17 14:53:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-09-17 14:53:37,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:37,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074278522] [2020-09-17 14:53:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:37,312 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-17 14:53:37,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074278522] [2020-09-17 14:53:37,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009481507] [2020-09-17 14:53:37,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-17 14:53:37,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-17 14:53:37,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:37,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-17 14:53:37,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:37,437 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-17 14:53:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-09-17 14:53:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20545759] [2020-09-17 14:53:37,438 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:37,442 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:37,447 INFO L274 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-09-17 14:53:37,447 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:37,447 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:37,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-17 14:53:37,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-17 14:53:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-17 14:53:37,449 INFO L87 Difference]: Start difference. First operand 325 states and 723 transitions. Second operand 9 states. [2020-09-17 14:53:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:37,549 INFO L93 Difference]: Finished difference Result 582 states and 1263 transitions. [2020-09-17 14:53:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-17 14:53:37,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-17 14:53:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:37,553 INFO L225 Difference]: With dead ends: 582 [2020-09-17 14:53:37,553 INFO L226 Difference]: Without dead ends: 582 [2020-09-17 14:53:37,554 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-17 14:53:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-09-17 14:53:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2020-09-17 14:53:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-09-17 14:53:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 931 transitions. [2020-09-17 14:53:37,570 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 931 transitions. Word has length 20 [2020-09-17 14:53:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:37,570 INFO L479 AbstractCegarLoop]: Abstraction has 416 states and 931 transitions. [2020-09-17 14:53:37,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-17 14:53:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 931 transitions. [2020-09-17 14:53:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-17 14:53:37,571 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:37,572 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-17 14:53:37,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:37,786 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-17 14:53:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-09-17 14:53:37,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:37,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029049238] [2020-09-17 14:53:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:38,223 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-17 14:53:38,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029049238] [2020-09-17 14:53:38,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:38,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-17 14:53:38,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971509308] [2020-09-17 14:53:38,226 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:38,230 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:38,235 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-09-17 14:53:38,235 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:38,248 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:38,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-17 14:53:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-17 14:53:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-17 14:53:38,249 INFO L87 Difference]: Start difference. First operand 416 states and 931 transitions. Second operand 9 states. [2020-09-17 14:53:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:38,505 INFO L93 Difference]: Finished difference Result 635 states and 1377 transitions. [2020-09-17 14:53:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-17 14:53:38,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-17 14:53:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:38,510 INFO L225 Difference]: With dead ends: 635 [2020-09-17 14:53:38,510 INFO L226 Difference]: Without dead ends: 573 [2020-09-17 14:53:38,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-17 14:53:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-09-17 14:53:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 442. [2020-09-17 14:53:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-09-17 14:53:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 986 transitions. [2020-09-17 14:53:38,525 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 986 transitions. Word has length 21 [2020-09-17 14:53:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:38,525 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 986 transitions. [2020-09-17 14:53:38,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-17 14:53:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 986 transitions. [2020-09-17 14:53:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-17 14:53:38,527 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:38,527 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-17 14:53:38,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-17 14:53:38,528 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-17 14:53:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-09-17 14:53:38,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:38,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92292661] [2020-09-17 14:53:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:38,631 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-17 14:53:38,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92292661] [2020-09-17 14:53:38,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372136098] [2020-09-17 14:53:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:38,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-17 14:53:38,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:38,740 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-17 14:53:38,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-17 14:53:38,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-09-17 14:53:38,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374725202] [2020-09-17 14:53:38,742 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:38,770 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:38,778 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-09-17 14:53:38,778 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:38,835 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:38,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-17 14:53:38,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:38,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-17 14:53:38,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-17 14:53:38,837 INFO L87 Difference]: Start difference. First operand 442 states and 986 transitions. Second operand 6 states. [2020-09-17 14:53:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:38,921 INFO L93 Difference]: Finished difference Result 600 states and 1292 transitions. [2020-09-17 14:53:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-17 14:53:38,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-17 14:53:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:38,927 INFO L225 Difference]: With dead ends: 600 [2020-09-17 14:53:38,927 INFO L226 Difference]: Without dead ends: 590 [2020-09-17 14:53:38,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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-17 14:53:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-17 14:53:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2020-09-17 14:53:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-09-17 14:53:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1103 transitions. [2020-09-17 14:53:38,945 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1103 transitions. Word has length 24 [2020-09-17 14:53:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:38,945 INFO L479 AbstractCegarLoop]: Abstraction has 500 states and 1103 transitions. [2020-09-17 14:53:38,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-17 14:53:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1103 transitions. [2020-09-17 14:53:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-17 14:53:38,947 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:38,947 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-09-17 14:53:39,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:39,161 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-17 14:53:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-09-17 14:53:39,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:39,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693484353] [2020-09-17 14:53:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:39,285 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-17 14:53:39,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693484353] [2020-09-17 14:53:39,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114359401] [2020-09-17 14:53:39,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-17 14:53:39,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-17 14:53:39,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:39,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-17 14:53:39,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:39,454 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-17 14:53:39,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:39,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-09-17 14:53:39,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162332894] [2020-09-17 14:53:39,456 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:39,461 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:39,467 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-09-17 14:53:39,468 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:39,468 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:39,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-17 14:53:39,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:39,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-17 14:53:39,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-17 14:53:39,469 INFO L87 Difference]: Start difference. First operand 500 states and 1103 transitions. Second operand 11 states. [2020-09-17 14:53:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:39,606 INFO L93 Difference]: Finished difference Result 839 states and 1799 transitions. [2020-09-17 14:53:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 14:53:39,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-09-17 14:53:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:39,612 INFO L225 Difference]: With dead ends: 839 [2020-09-17 14:53:39,612 INFO L226 Difference]: Without dead ends: 839 [2020-09-17 14:53:39,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-17 14:53:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-09-17 14:53:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 591. [2020-09-17 14:53:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-17 14:53:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1311 transitions. [2020-09-17 14:53:39,633 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1311 transitions. Word has length 27 [2020-09-17 14:53:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:39,633 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1311 transitions. [2020-09-17 14:53:39,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-17 14:53:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1311 transitions. [2020-09-17 14:53:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-17 14:53:39,635 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:39,635 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-17 14:53:39,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:39,849 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-17 14:53:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-09-17 14:53:39,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:39,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539975876] [2020-09-17 14:53:39,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:40,334 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-17 14:53:40,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539975876] [2020-09-17 14:53:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:40,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-17 14:53:40,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671092411] [2020-09-17 14:53:40,335 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:40,340 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:40,349 INFO L274 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-09-17 14:53:40,349 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:40,441 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14408#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4)) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4))) (= |~#arr~0.offset| 0)), 14409#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (= |~#arr~0.offset| 0))] [2020-09-17 14:53:40,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-17 14:53:40,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-17 14:53:40,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-09-17 14:53:40,442 INFO L87 Difference]: Start difference. First operand 591 states and 1311 transitions. Second operand 17 states. [2020-09-17 14:53:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:42,578 INFO L93 Difference]: Finished difference Result 946 states and 2054 transitions. [2020-09-17 14:53:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-17 14:53:42,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-09-17 14:53:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:42,585 INFO L225 Difference]: With dead ends: 946 [2020-09-17 14:53:42,585 INFO L226 Difference]: Without dead ends: 906 [2020-09-17 14:53:42,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 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-17 14:53:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-17 14:53:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 605. [2020-09-17 14:53:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-09-17 14:53:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1354 transitions. [2020-09-17 14:53:42,604 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1354 transitions. Word has length 28 [2020-09-17 14:53:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:42,605 INFO L479 AbstractCegarLoop]: Abstraction has 605 states and 1354 transitions. [2020-09-17 14:53:42,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-17 14:53:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1354 transitions. [2020-09-17 14:53:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-17 14:53:42,607 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:42,607 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-17 14:53:42,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-17 14:53:42,607 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-17 14:53:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-09-17 14:53:42,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:42,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950939018] [2020-09-17 14:53:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:42,727 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-17 14:53:42,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950939018] [2020-09-17 14:53:42,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921246239] [2020-09-17 14:53:42,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-17 14:53:42,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-17 14:53:42,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:42,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-17 14:53:42,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:42,864 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-17 14:53:42,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:42,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-17 14:53:42,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475470123] [2020-09-17 14:53:42,865 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:42,872 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:42,886 INFO L274 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-09-17 14:53:42,886 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:42,934 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:42,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-17 14:53:42,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-17 14:53:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-17 14:53:42,936 INFO L87 Difference]: Start difference. First operand 605 states and 1354 transitions. Second operand 10 states. [2020-09-17 14:53:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:43,071 INFO L93 Difference]: Finished difference Result 907 states and 1949 transitions. [2020-09-17 14:53:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 14:53:43,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-17 14:53:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:43,077 INFO L225 Difference]: With dead ends: 907 [2020-09-17 14:53:43,078 INFO L226 Difference]: Without dead ends: 907 [2020-09-17 14:53:43,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-09-17 14:53:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-09-17 14:53:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 651. [2020-09-17 14:53:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2020-09-17 14:53:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1483 transitions. [2020-09-17 14:53:43,099 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1483 transitions. Word has length 31 [2020-09-17 14:53:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:43,099 INFO L479 AbstractCegarLoop]: Abstraction has 651 states and 1483 transitions. [2020-09-17 14:53:43,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-17 14:53:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1483 transitions. [2020-09-17 14:53:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-17 14:53:43,101 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:43,101 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-09-17 14:53:43,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-17 14:53:43,315 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-17 14:53:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-09-17 14:53:43,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:43,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294848483] [2020-09-17 14:53:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:43,472 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-17 14:53:43,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294848483] [2020-09-17 14:53:43,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058196414] [2020-09-17 14:53:43,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-17 14:53:43,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-17 14:53:43,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:43,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-17 14:53:43,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:43,593 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-17 14:53:43,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:43,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-09-17 14:53:43,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1114070375] [2020-09-17 14:53:43,594 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:43,602 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:43,612 INFO L274 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-09-17 14:53:43,613 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:43,613 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:43,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-17 14:53:43,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-17 14:53:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-09-17 14:53:43,615 INFO L87 Difference]: Start difference. First operand 651 states and 1483 transitions. Second operand 13 states. [2020-09-17 14:53:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:43,794 INFO L93 Difference]: Finished difference Result 1005 states and 2204 transitions. [2020-09-17 14:53:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-17 14:53:43,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-09-17 14:53:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:43,801 INFO L225 Difference]: With dead ends: 1005 [2020-09-17 14:53:43,801 INFO L226 Difference]: Without dead ends: 1005 [2020-09-17 14:53:43,802 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-17 14:53:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2020-09-17 14:53:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 742. [2020-09-17 14:53:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2020-09-17 14:53:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1691 transitions. [2020-09-17 14:53:43,825 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1691 transitions. Word has length 34 [2020-09-17 14:53:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:43,825 INFO L479 AbstractCegarLoop]: Abstraction has 742 states and 1691 transitions. [2020-09-17 14:53:43,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-17 14:53:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1691 transitions. [2020-09-17 14:53:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-17 14:53:43,828 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:43,828 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-17 14:53:44,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:44,041 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-17 14:53:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-09-17 14:53:44,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:44,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968755490] [2020-09-17 14:53:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:44,753 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-17 14:53:44,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968755490] [2020-09-17 14:53:44,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844832609] [2020-09-17 14:53:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:44,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 70 conjunts are in the unsatisfiable core [2020-09-17 14:53:44,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:45,036 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 14:53:45,037 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-17 14:53:45,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-17 14:53:45,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:45,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:45,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:45,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-09-17 14:53:45,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:45,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:45,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:45,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:45,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-09-17 14:53:45,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:45,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-09-17 14:53:45,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-09-17 14:53:45,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-09-17 14:53:45,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-09-17 14:53:45,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-17 14:53:45,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-09-17 14:53:45,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:45,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-17 14:53:45,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:45,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:45,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:45,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:45,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,075 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:45,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:45,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:45,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:45,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:45,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,129 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,145 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-17 14:53:45,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:45,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:45,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:45,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:45,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:45,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:45,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:45,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:45,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:45,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:45,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,179 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,185 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,191 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-17 14:53:45,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,201 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,206 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,207 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,212 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,217 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,234 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,235 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,247 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,254 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:45,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:45,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:45,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:45,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:45,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:45,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:45,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:45,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,287 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,292 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:45,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:45,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:45,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:45,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:45,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:45,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:45,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:45,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:45,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,305 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:45,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:45,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:45,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:45,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:45,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:45,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:45,310 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:45,318 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-17 14:53:45,965 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-09-17 14:53:45,966 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-09-17 14:53:45,992 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-09-17 14:53:46,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:46,195 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-17 14:53:46,200 INFO L168 Benchmark]: Toolchain (without parser) took 17035.38 ms. Allocated memory was 136.8 MB in the beginning and 383.3 MB in the end (delta: 246.4 MB). Free memory was 98.2 MB in the beginning and 80.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,201 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1000.98 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 97.6 MB in the beginning and 131.7 MB in the end (delta: -34.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.24 ms. Allocated memory is still 200.8 MB. Free memory was 131.7 MB in the beginning and 128.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,203 INFO L168 Benchmark]: Boogie Preprocessor took 42.36 ms. Allocated memory is still 200.8 MB. Free memory was 128.8 MB in the beginning and 127.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,204 INFO L168 Benchmark]: RCFGBuilder took 635.28 ms. Allocated memory is still 200.8 MB. Free memory was 127.4 MB in the beginning and 94.8 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,205 INFO L168 Benchmark]: TraceAbstraction took 15270.36 ms. Allocated memory was 200.8 MB in the beginning and 383.3 MB in the end (delta: 182.5 MB). Free memory was 94.1 MB in the beginning and 80.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:46,209 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 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1000.98 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 97.6 MB in the beginning and 131.7 MB in the end (delta: -34.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.24 ms. Allocated memory is still 200.8 MB. Free memory was 131.7 MB in the beginning and 128.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.36 ms. Allocated memory is still 200.8 MB. Free memory was 128.8 MB in the beginning and 127.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 635.28 ms. Allocated memory is still 200.8 MB. Free memory was 127.4 MB in the beginning and 94.8 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15270.36 ms. Allocated memory was 200.8 MB in the beginning and 383.3 MB in the end (delta: 182.5 MB). Free memory was 94.1 MB in the beginning and 80.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 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...