/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:30:21,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:30:21,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:30:21,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:30:21,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:30:21,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:30:21,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:30:21,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:30:21,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:30:21,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:30:21,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:30:21,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:30:21,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:30:21,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:30:21,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:30:21,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:30:21,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:30:21,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:30:21,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:30:21,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:30:21,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:30:21,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:30:21,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:30:21,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:30:21,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:30:21,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:30:21,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:30:21,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:30:21,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:30:21,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:30:21,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:30:21,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:30:21,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:30:21,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:30:22,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:30:22,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:30:22,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:30:22,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:30:22,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:30:22,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:30:22,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:30:22,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 12:30:22,028 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:30:22,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:30:22,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:30:22,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:30:22,030 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:30:22,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:30:22,031 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:30:22,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:30:22,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:30:22,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:30:22,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:30:22,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:30:22,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:30:22,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:30:22,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:30:22,032 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:30:22,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:30:22,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:30:22,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:30:22,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:30:22,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:30:22,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:30:22,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:30:22,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:30:22,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:30:22,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:30:22,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:30:22,035 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 12:30:22,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:30:22,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:30:22,039 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 12:30:22,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:30:22,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:30:22,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:30:22,395 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:30:22,395 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:30:22,396 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2020-10-16 12:30:22,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66bd559b8/4711c1cdf77f4ad396ae20566450b63b/FLAG4582ca32c [2020-10-16 12:30:23,114 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:30:23,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-10-16 12:30:23,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66bd559b8/4711c1cdf77f4ad396ae20566450b63b/FLAG4582ca32c [2020-10-16 12:30:23,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/66bd559b8/4711c1cdf77f4ad396ae20566450b63b [2020-10-16 12:30:23,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:30:23,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:30:23,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:30:23,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:30:23,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:30:23,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:30:23" (1/1) ... [2020-10-16 12:30:23,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720494db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:23, skipping insertion in model container [2020-10-16 12:30:23,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:30:23" (1/1) ... [2020-10-16 12:30:23,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:30:23,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:30:24,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:30:24,133 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:30:24,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:30:24,380 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:30:24,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24 WrapperNode [2020-10-16 12:30:24,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:30:24,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:30:24,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:30:24,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:30:24,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:30:24,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:30:24,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:30:24,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:30:24,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... [2020-10-16 12:30:24,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:30:24,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:30:24,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:30:24,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:30:24,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:30:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-16 12:30:24,582 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-16 12:30:24,583 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-16 12:30:24,583 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-16 12:30:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:30:24,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:30:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 12:30:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:30:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-16 12:30:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 12:30:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:30:24,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:30:24,588 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:30:25,132 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:30:25,133 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-16 12:30:25,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:25 BoogieIcfgContainer [2020-10-16 12:30:25,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:30:25,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:30:25,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:30:25,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:30:25,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:30:23" (1/3) ... [2020-10-16 12:30:25,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:25, skipping insertion in model container [2020-10-16 12:30:25,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:24" (2/3) ... [2020-10-16 12:30:25,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:25, skipping insertion in model container [2020-10-16 12:30:25,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:25" (3/3) ... [2020-10-16 12:30:25,147 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-10-16 12:30:25,160 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:30:25,160 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:30:25,169 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:30:25,170 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:30:25,222 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,223 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,223 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,223 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,223 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,224 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,224 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,224 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,224 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,225 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,225 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,225 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,225 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,226 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,226 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,226 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,226 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,226 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,227 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,228 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,229 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,231 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,233 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,235 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,238 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,238 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,239 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,240 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,240 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,240 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,240 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,240 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,241 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,241 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,241 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,241 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,242 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,242 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,242 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,242 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,242 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,243 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,244 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,244 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,246 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,246 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,246 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,246 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,246 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,247 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,247 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,247 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,248 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,248 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,248 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,248 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,248 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,249 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,249 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,249 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,249 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,249 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,250 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,250 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,255 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,255 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,256 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,257 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,257 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,257 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,257 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,258 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,258 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,258 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,258 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,258 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,259 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,259 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,267 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,267 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,268 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,268 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,268 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,268 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,268 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,269 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,269 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,269 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,269 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,269 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,270 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,270 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,270 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,270 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,270 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,271 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:30:25,281 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-16 12:30:25,297 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:30:25,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:30:25,320 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:30:25,321 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:30:25,321 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 12:30:25,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:30:25,321 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:30:25,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:30:25,321 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:30:25,338 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:30:25,339 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-10-16 12:30:25,342 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 138 transitions, 298 flow [2020-10-16 12:30:25,344 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-10-16 12:30:25,414 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-10-16 12:30:25,415 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 12:30:25,424 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-10-16 12:30:25,430 INFO L117 LiptonReduction]: Number of co-enabled transitions 5744 [2020-10-16 12:30:28,509 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-10-16 12:30:28,728 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 12:30:29,088 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 12:30:29,307 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-16 12:30:29,320 INFO L132 LiptonReduction]: Checked pairs total: 10440 [2020-10-16 12:30:29,321 INFO L134 LiptonReduction]: Total number of compositions: 123 [2020-10-16 12:30:29,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-10-16 12:30:29,355 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-10-16 12:30:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-10-16 12:30:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-16 12:30:29,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:29,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 12:30:29,366 INFO L429 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:29,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-10-16 12:30:29,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:29,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519609717] [2020-10-16 12:30:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:29,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519609717] [2020-10-16 12:30:29,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:29,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:30:29,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539829688] [2020-10-16 12:30:29,620 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:29,623 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:29,637 INFO L258 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-10-16 12:30:29,638 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:29,642 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:29,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:30:29,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:30:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:30:29,662 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-10-16 12:30:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:29,730 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-10-16 12:30:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:30:29,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-16 12:30:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:29,766 INFO L225 Difference]: With dead ends: 504 [2020-10-16 12:30:29,766 INFO L226 Difference]: Without dead ends: 460 [2020-10-16 12:30:29,769 INFO L677 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-10-16 12:30:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-16 12:30:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-10-16 12:30:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 12:30:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-10-16 12:30:29,864 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-10-16 12:30:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:29,865 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-10-16 12:30:29,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:30:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-10-16 12:30:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:30:29,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:29,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:30:29,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:30:29,867 INFO L429 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-10-16 12:30:29,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:29,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544967085] [2020-10-16 12:30:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:30,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544967085] [2020-10-16 12:30:30,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:30,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:30:30,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029121081] [2020-10-16 12:30:30,036 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:30,037 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:30,039 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-16 12:30:30,041 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:30,042 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:30,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:30:30,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:30:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:30:30,044 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-10-16 12:30:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:30,067 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-10-16 12:30:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:30:30,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:30:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:30,073 INFO L225 Difference]: With dead ends: 464 [2020-10-16 12:30:30,074 INFO L226 Difference]: Without dead ends: 464 [2020-10-16 12:30:30,075 INFO L677 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-10-16 12:30:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-16 12:30:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-16 12:30:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-16 12:30:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-10-16 12:30:30,109 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-10-16 12:30:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:30,110 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-10-16 12:30:30,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:30:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-10-16 12:30:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:30:30,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:30,112 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:30:30,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:30:30,113 INFO L429 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-10-16 12:30:30,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:30,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730404732] [2020-10-16 12:30:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:30,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730404732] [2020-10-16 12:30:30,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010556143] [2020-10-16 12:30:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:30,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-16 12:30:30,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:30,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 12:30:30,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-16 12:30:30,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742933317] [2020-10-16 12:30:30,382 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:30,385 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:30,388 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-16 12:30:30,388 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:30,389 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:30,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:30:30,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:30:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:30:30,394 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 5 states. [2020-10-16 12:30:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:30,525 INFO L93 Difference]: Finished difference Result 775 states and 1949 transitions. [2020-10-16 12:30:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:30:30,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:30:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:30,535 INFO L225 Difference]: With dead ends: 775 [2020-10-16 12:30:30,535 INFO L226 Difference]: Without dead ends: 775 [2020-10-16 12:30:30,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:30:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-10-16 12:30:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 592. [2020-10-16 12:30:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-10-16 12:30:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1551 transitions. [2020-10-16 12:30:30,605 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1551 transitions. Word has length 13 [2020-10-16 12:30:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:30,606 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 1551 transitions. [2020-10-16 12:30:30,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:30:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1551 transitions. [2020-10-16 12:30:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:30:30,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:30,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:30:30,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-16 12:30:30,826 INFO L429 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-10-16 12:30:30,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:30,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073219484] [2020-10-16 12:30:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:30,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073219484] [2020-10-16 12:30:30,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:30,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:30:30,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82289089] [2020-10-16 12:30:30,889 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:30,891 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:30,897 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-10-16 12:30:30,898 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:30,942 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:30,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:30:30,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:30:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:30:30,943 INFO L87 Difference]: Start difference. First operand 592 states and 1551 transitions. Second operand 3 states. [2020-10-16 12:30:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:30,970 INFO L93 Difference]: Finished difference Result 311 states and 689 transitions. [2020-10-16 12:30:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:30:30,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 12:30:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:30,973 INFO L225 Difference]: With dead ends: 311 [2020-10-16 12:30:30,974 INFO L226 Difference]: Without dead ends: 311 [2020-10-16 12:30:30,974 INFO L677 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-10-16 12:30:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-10-16 12:30:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2020-10-16 12:30:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-16 12:30:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 662 transitions. [2020-10-16 12:30:30,986 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 662 transitions. Word has length 16 [2020-10-16 12:30:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:30,987 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 662 transitions. [2020-10-16 12:30:30,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:30:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 662 transitions. [2020-10-16 12:30:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:30:30,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:30,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:30:30,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:30:30,990 INFO L429 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-10-16 12:30:30,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:30,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362819429] [2020-10-16 12:30:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:31,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362819429] [2020-10-16 12:30:31,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:31,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:30:31,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347073971] [2020-10-16 12:30:31,082 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:31,086 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:31,093 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-10-16 12:30:31,093 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:31,097 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:31,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:30:31,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:30:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:30:31,100 INFO L87 Difference]: Start difference. First operand 301 states and 662 transitions. Second operand 3 states. [2020-10-16 12:30:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:31,144 INFO L93 Difference]: Finished difference Result 379 states and 830 transitions. [2020-10-16 12:30:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:30:31,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-16 12:30:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:31,148 INFO L225 Difference]: With dead ends: 379 [2020-10-16 12:30:31,149 INFO L226 Difference]: Without dead ends: 379 [2020-10-16 12:30:31,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-10-16 12:30:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-16 12:30:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 319. [2020-10-16 12:30:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2020-10-16 12:30:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 695 transitions. [2020-10-16 12:30:31,161 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 695 transitions. Word has length 17 [2020-10-16 12:30:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:31,163 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 695 transitions. [2020-10-16 12:30:31,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:30:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 695 transitions. [2020-10-16 12:30:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:30:31,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:31,172 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-16 12:30:31,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:30:31,173 INFO L429 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-10-16 12:30:31,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:31,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898527821] [2020-10-16 12:30:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:31,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898527821] [2020-10-16 12:30:31,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042390497] [2020-10-16 12:30:31,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:31,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-16 12:30:31,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 12:30:31,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-16 12:30:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:31,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 12:30:31,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-10-16 12:30:31,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638537988] [2020-10-16 12:30:31,391 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:31,397 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:31,403 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-10-16 12:30:31,403 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:31,404 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:31,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:30:31,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:31,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:30:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:30:31,406 INFO L87 Difference]: Start difference. First operand 319 states and 695 transitions. Second operand 7 states. [2020-10-16 12:30:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:31,526 INFO L93 Difference]: Finished difference Result 520 states and 1122 transitions. [2020-10-16 12:30:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:30:31,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-16 12:30:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:31,530 INFO L225 Difference]: With dead ends: 520 [2020-10-16 12:30:31,531 INFO L226 Difference]: Without dead ends: 520 [2020-10-16 12:30:31,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:30:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-16 12:30:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 396. [2020-10-16 12:30:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-16 12:30:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 864 transitions. [2020-10-16 12:30:31,548 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 864 transitions. Word has length 20 [2020-10-16 12:30:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:31,548 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 864 transitions. [2020-10-16 12:30:31,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:30:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 864 transitions. [2020-10-16 12:30:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:30:31,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:31,552 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-10-16 12:30:31,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:31,759 INFO L429 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-10-16 12:30:31,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:31,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599435956] [2020-10-16 12:30:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:32,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599435956] [2020-10-16 12:30:32,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:32,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:30:32,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [423883174] [2020-10-16 12:30:32,067 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:32,070 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:32,078 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-10-16 12:30:32,078 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:32,110 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:32,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:30:32,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:30:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:30:32,112 INFO L87 Difference]: Start difference. First operand 396 states and 864 transitions. Second operand 9 states. [2020-10-16 12:30:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:32,430 INFO L93 Difference]: Finished difference Result 602 states and 1308 transitions. [2020-10-16 12:30:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:30:32,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 12:30:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:32,435 INFO L225 Difference]: With dead ends: 602 [2020-10-16 12:30:32,435 INFO L226 Difference]: Without dead ends: 520 [2020-10-16 12:30:32,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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-10-16 12:30:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-16 12:30:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 424. [2020-10-16 12:30:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-16 12:30:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 924 transitions. [2020-10-16 12:30:32,450 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 924 transitions. Word has length 21 [2020-10-16 12:30:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:32,451 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 924 transitions. [2020-10-16 12:30:32,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:30:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 924 transitions. [2020-10-16 12:30:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:30:32,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:32,452 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-10-16 12:30:32,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:30:32,453 INFO L429 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-10-16 12:30:32,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:32,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656512681] [2020-10-16 12:30:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:32,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656512681] [2020-10-16 12:30:32,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88618877] [2020-10-16 12:30:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:32,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-16 12:30:32,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 12:30:32,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-16 12:30:32,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-10-16 12:30:32,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488576064] [2020-10-16 12:30:32,633 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:32,637 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:32,646 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-10-16 12:30:32,646 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:32,676 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:32,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:30:32,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:32,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:30:32,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:30:32,678 INFO L87 Difference]: Start difference. First operand 424 states and 924 transitions. Second operand 6 states. [2020-10-16 12:30:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:32,760 INFO L93 Difference]: Finished difference Result 647 states and 1381 transitions. [2020-10-16 12:30:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:30:32,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-16 12:30:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:32,765 INFO L225 Difference]: With dead ends: 647 [2020-10-16 12:30:32,765 INFO L226 Difference]: Without dead ends: 632 [2020-10-16 12:30:32,766 INFO L677 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-10-16 12:30:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-10-16 12:30:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 460. [2020-10-16 12:30:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-10-16 12:30:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 996 transitions. [2020-10-16 12:30:32,782 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 996 transitions. Word has length 24 [2020-10-16 12:30:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:32,783 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 996 transitions. [2020-10-16 12:30:32,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:30:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 996 transitions. [2020-10-16 12:30:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:30:32,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:32,785 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-10-16 12:30:32,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:32,998 INFO L429 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-10-16 12:30:33,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:33,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769544524] [2020-10-16 12:30:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:33,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769544524] [2020-10-16 12:30:33,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796580428] [2020-10-16 12:30:33,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:33,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-16 12:30:33,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 12:30:33,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-16 12:30:33,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:33,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 12:30:33,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-10-16 12:30:33,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632036374] [2020-10-16 12:30:33,250 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:33,255 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:33,262 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-10-16 12:30:33,263 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:33,263 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:33,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:30:33,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:30:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:30:33,265 INFO L87 Difference]: Start difference. First operand 460 states and 996 transitions. Second operand 9 states. [2020-10-16 12:30:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:33,395 INFO L93 Difference]: Finished difference Result 759 states and 1615 transitions. [2020-10-16 12:30:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:30:33,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-16 12:30:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:33,401 INFO L225 Difference]: With dead ends: 759 [2020-10-16 12:30:33,401 INFO L226 Difference]: Without dead ends: 759 [2020-10-16 12:30:33,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:30:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-10-16 12:30:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 553. [2020-10-16 12:30:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-16 12:30:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1211 transitions. [2020-10-16 12:30:33,419 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1211 transitions. Word has length 27 [2020-10-16 12:30:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:33,420 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 1211 transitions. [2020-10-16 12:30:33,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:30:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1211 transitions. [2020-10-16 12:30:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:30:33,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:33,422 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-10-16 12:30:33,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:33,637 INFO L429 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-10-16 12:30:33,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:33,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512023672] [2020-10-16 12:30:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-16 12:30:34,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512023672] [2020-10-16 12:30:34,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:30:34,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 12:30:34,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014532268] [2020-10-16 12:30:34,079 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:34,084 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:34,095 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-10-16 12:30:34,095 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:34,178 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13950#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4))) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4)) 399)), 13951#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |~#arr~0.offset| 0))] [2020-10-16 12:30:34,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-16 12:30:34,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-16 12:30:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:30:34,179 INFO L87 Difference]: Start difference. First operand 553 states and 1211 transitions. Second operand 17 states. [2020-10-16 12:30:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:36,085 INFO L93 Difference]: Finished difference Result 868 states and 1864 transitions. [2020-10-16 12:30:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-16 12:30:36,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-10-16 12:30:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:36,096 INFO L225 Difference]: With dead ends: 868 [2020-10-16 12:30:36,096 INFO L226 Difference]: Without dead ends: 828 [2020-10-16 12:30:36,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2020-10-16 12:30:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-10-16 12:30:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 563. [2020-10-16 12:30:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-10-16 12:30:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1242 transitions. [2020-10-16 12:30:36,116 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1242 transitions. Word has length 28 [2020-10-16 12:30:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:36,117 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 1242 transitions. [2020-10-16 12:30:36,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-16 12:30:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1242 transitions. [2020-10-16 12:30:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-16 12:30:36,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:36,123 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-10-16 12:30:36,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:30:36,123 INFO L429 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-10-16 12:30:36,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:36,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484137797] [2020-10-16 12:30:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 12:30:36,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484137797] [2020-10-16 12:30:36,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919890874] [2020-10-16 12:30:36,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:36,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-16 12:30:36,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 12:30:36,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-16 12:30:36,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-16 12:30:36,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 12:30:36,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-16 12:30:36,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075274260] [2020-10-16 12:30:36,361 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:36,372 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:36,411 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-10-16 12:30:36,411 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:36,434 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:36,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:30:36,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:36,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:30:36,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:30:36,436 INFO L87 Difference]: Start difference. First operand 563 states and 1242 transitions. Second operand 8 states. [2020-10-16 12:30:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:36,554 INFO L93 Difference]: Finished difference Result 831 states and 1775 transitions. [2020-10-16 12:30:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:30:36,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-10-16 12:30:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:36,559 INFO L225 Difference]: With dead ends: 831 [2020-10-16 12:30:36,559 INFO L226 Difference]: Without dead ends: 831 [2020-10-16 12:30:36,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:30:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2020-10-16 12:30:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 607. [2020-10-16 12:30:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-10-16 12:30:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1366 transitions. [2020-10-16 12:30:36,576 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1366 transitions. Word has length 31 [2020-10-16 12:30:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:36,577 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 1366 transitions. [2020-10-16 12:30:36,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:30:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1366 transitions. [2020-10-16 12:30:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-16 12:30:36,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:36,579 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-10-16 12:30:36,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-16 12:30:36,795 INFO L429 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-10-16 12:30:36,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:36,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077652603] [2020-10-16 12:30:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:36,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077652603] [2020-10-16 12:30:36,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248029148] [2020-10-16 12:30:36,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:36,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-16 12:30:36,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-16 12:30:36,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-16 12:30:37,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:37,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-16 12:30:37,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-10-16 12:30:37,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028479510] [2020-10-16 12:30:37,062 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:30:37,070 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:30:37,081 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-10-16 12:30:37,081 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:30:37,082 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:30:37,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:30:37,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:30:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:30:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:30:37,083 INFO L87 Difference]: Start difference. First operand 607 states and 1366 transitions. Second operand 11 states. [2020-10-16 12:30:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:30:37,230 INFO L93 Difference]: Finished difference Result 913 states and 1978 transitions. [2020-10-16 12:30:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:30:37,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-10-16 12:30:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:30:37,236 INFO L225 Difference]: With dead ends: 913 [2020-10-16 12:30:37,237 INFO L226 Difference]: Without dead ends: 913 [2020-10-16 12:30:37,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:30:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2020-10-16 12:30:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 684. [2020-10-16 12:30:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-10-16 12:30:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1535 transitions. [2020-10-16 12:30:37,256 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1535 transitions. Word has length 34 [2020-10-16 12:30:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:30:37,256 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1535 transitions. [2020-10-16 12:30:37,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:30:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1535 transitions. [2020-10-16 12:30:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-16 12:30:37,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:30:37,259 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-10-16 12:30:37,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:37,473 INFO L429 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:30:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:30:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-10-16 12:30:37,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:30:37,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570054577] [2020-10-16 12:30:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:30:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:30:38,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570054577] [2020-10-16 12:30:38,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113896681] [2020-10-16 12:30:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:30:38,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2020-10-16 12:30:38,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-16 12:30:38,354 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 12:30:38,355 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-10-16 12:30:38,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-10-16 12:30:38,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-16 12:30:38,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-10-16 12:30:38,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-10-16 12:30:38,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-10-16 12:30:38,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-16 12:30:38,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-16 12:30:38,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-10-16 12:30:38,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 12:30:38,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-10-16 12:30:38,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 12:30:38,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-10-16 12:30:38,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-10-16 12:30:38,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-10-16 12:30:38,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-10-16 12:30:38,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 12:30:38,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-10-16 12:30:38,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 12:30:38,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-10-16 12:30:38,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-16 12:30:38,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-16 12:30:38,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-16 12:30:38,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-16 12:30:38,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,450 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-16 12:30:38,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-16 12:30:38,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-16 12:30:38,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-16 12:30:38,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-16 12:30:38,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,552 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,582 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-16 12:30:38,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-16 12:30:38,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-16 12:30:38,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-16 12:30:38,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-16 12:30:38,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-16 12:30:38,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-16 12:30:38,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-16 12:30:38,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 12:30:38,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-16 12:30:38,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-16 12:30:38,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,638 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,644 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,650 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-16 12:30:38,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,660 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,664 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,665 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,669 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,674 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,694 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,696 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,709 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,716 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-16 12:30:38,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-16 12:30:38,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-16 12:30:38,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-16 12:30:38,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-16 12:30:38,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 12:30:38,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-16 12:30:38,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-16 12:30:38,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,756 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,762 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-16 12:30:38,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-16 12:30:38,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-16 12:30:38,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-16 12:30:38,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-16 12:30:38,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 12:30:38,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-16 12:30:38,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 12:30:38,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-16 12:30:38,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,779 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-16 12:30:38,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-16 12:30:38,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-16 12:30:38,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:30:38,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-16 12:30:38,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 12:30:38,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-16 12:30:38,784 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-16 12:30:38,792 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-16 12:30:39,409 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-10-16 12:30:39,411 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-10-16 12:30:39,424 WARN L340 FreeRefinementEngine]: Global settings require throwing the following exception [2020-10-16 12:30:39,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-16 12:30:39,627 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) 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:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-10-16 12:30:39,632 INFO L168 Benchmark]: Toolchain (without parser) took 16251.28 ms. Allocated memory was 146.3 MB in the beginning and 373.3 MB in the end (delta: 227.0 MB). Free memory was 100.9 MB in the beginning and 99.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 228.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,635 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:30:39,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 998.25 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 132.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.39 ms. Allocated memory is still 203.9 MB. Free memory was 132.6 MB in the beginning and 129.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,638 INFO L168 Benchmark]: Boogie Preprocessor took 43.22 ms. Allocated memory is still 203.9 MB. Free memory was 129.8 MB in the beginning and 127.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,643 INFO L168 Benchmark]: RCFGBuilder took 631.79 ms. Allocated memory is still 203.9 MB. Free memory was 127.7 MB in the beginning and 95.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,644 INFO L168 Benchmark]: TraceAbstraction took 14491.86 ms. Allocated memory was 203.9 MB in the beginning and 373.3 MB in the end (delta: 169.3 MB). Free memory was 94.9 MB in the beginning and 99.8 MB in the end (delta: -5.0 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:30:39,655 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.21 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 998.25 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 132.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.39 ms. Allocated memory is still 203.9 MB. Free memory was 132.6 MB in the beginning and 129.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.22 ms. Allocated memory is still 203.9 MB. Free memory was 129.8 MB in the beginning and 127.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 631.79 ms. Allocated memory is still 203.9 MB. Free memory was 127.7 MB in the beginning and 95.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14491.86 ms. Allocated memory was 203.9 MB in the beginning and 373.3 MB in the end (delta: 169.3 MB). Free memory was 94.9 MB in the beginning and 99.8 MB in the end (delta: -5.0 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3240 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 186 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 133 PlacesBefore, 40 PlacesAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 5744 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 123 TotalNumberOfCompositions, 10440 MoverChecksTotal - 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...