/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:40:22,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:40:22,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:40:22,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:40:22,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:40:22,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:40:22,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:40:22,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:40:22,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:40:22,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:40:22,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:40:22,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:40:22,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:40:22,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:40:22,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:40:22,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:40:22,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:40:22,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:40:22,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:40:22,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:40:22,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:40:22,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:40:22,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:40:22,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:40:22,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:40:22,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:40:22,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:40:22,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:40:22,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:40:22,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:40:22,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:40:22,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:40:22,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:40:22,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:40:22,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:40:22,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:40:22,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:40:22,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:40:22,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:40:22,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:40:22,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:40:22,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:40:22,206 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:40:22,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:40:22,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:40:22,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:40:22,208 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:40:22,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:40:22,208 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:40:22,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:40:22,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:40:22,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:40:22,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:40:22,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:40:22,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:40:22,210 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:40:22,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:40:22,210 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:40:22,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:40:22,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:40:22,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:40:22,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:40:22,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:40:22,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:40:22,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:40:22,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:40:22,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:40:22,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:40:22,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:40:22,213 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:40:22,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:40:22,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:40:22,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:40:22,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:40:22,531 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:40:22,533 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:40:22,534 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-05 23:40:22,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c9f266e/2f73b7e241c841479d258c1b8cba68ed/FLAG44ce48c7c [2020-10-05 23:40:23,146 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:40:23,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-05 23:40:23,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c9f266e/2f73b7e241c841479d258c1b8cba68ed/FLAG44ce48c7c [2020-10-05 23:40:23,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c9f266e/2f73b7e241c841479d258c1b8cba68ed [2020-10-05 23:40:23,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:40:23,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:40:23,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:23,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:40:23,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:40:23,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:23" (1/1) ... [2020-10-05 23:40:23,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c7e57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:23, skipping insertion in model container [2020-10-05 23:40:23,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:23" (1/1) ... [2020-10-05 23:40:23,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:40:23,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:40:24,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:24,180 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:40:24,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:24,365 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:40:24,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24 WrapperNode [2020-10-05 23:40:24,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:24,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:24,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:40:24,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:40:24,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:24,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:40:24,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:40:24,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:40:24,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... [2020-10-05 23:40:24,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:40:24,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:40:24,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:40:24,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:40:24,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:40:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 23:40:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:40:24,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:40:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:40:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:40:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:40:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:40:24,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:40:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:40:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:40:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:40:24,608 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:40:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:40:24,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-05 23:40:24,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:40:24,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:40:24,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:40:24,613 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:40:28,468 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:40:28,469 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:40:28,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:28 BoogieIcfgContainer [2020-10-05 23:40:28,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:40:28,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:40:28,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:40:28,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:40:28,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:40:23" (1/3) ... [2020-10-05 23:40:28,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e7cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:28, skipping insertion in model container [2020-10-05 23:40:28,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:24" (2/3) ... [2020-10-05 23:40:28,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e7cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:28, skipping insertion in model container [2020-10-05 23:40:28,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:28" (3/3) ... [2020-10-05 23:40:28,481 INFO L109 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2020-10-05 23:40:28,491 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:40:28,491 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:40:28,500 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:40:28,501 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,544 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,544 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,557 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,583 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,583 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,584 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,584 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,584 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,584 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,584 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,585 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,585 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,585 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,585 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,612 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:28,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:40:28,645 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:40:28,645 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:40:28,645 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:40:28,645 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:40:28,645 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:40:28,645 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:40:28,645 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:40:28,646 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:40:28,663 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 272 flow [2020-10-05 23:40:28,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2020-10-05 23:40:28,726 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2020-10-05 23:40:28,726 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:28,732 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-05 23:40:28,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2020-10-05 23:40:28,769 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2020-10-05 23:40:28,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:28,770 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-05 23:40:28,773 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2274 [2020-10-05 23:40:28,775 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:40:29,216 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-05 23:40:33,711 WARN L193 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-05 23:40:33,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 4, 3, 2, 1] term [2020-10-05 23:40:33,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:33,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-05 23:40:33,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:33,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-05 23:40:33,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:33,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 3, 2, 1] term [2020-10-05 23:40:33,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:33,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-05 23:40:33,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:33,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-05 23:40:33,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:35,249 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-05 23:40:36,161 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-05 23:40:36,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-05 23:40:36,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:36,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-05 23:40:36,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 23:40:36,293 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-05 23:40:36,703 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-05 23:40:37,155 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-10-05 23:40:38,198 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-05 23:40:38,327 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-05 23:40:38,898 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2020-10-05 23:40:39,162 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-10-05 23:40:39,171 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5128 [2020-10-05 23:40:39,171 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2020-10-05 23:40:39,175 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-05 23:40:39,306 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2250 states. [2020-10-05 23:40:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states. [2020-10-05 23:40:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:40:39,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:39,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:40:39,316 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1760210776, now seen corresponding path program 1 times [2020-10-05 23:40:39,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:39,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344435748] [2020-10-05 23:40:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:39,588 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-05 23:40:39,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344435748] [2020-10-05 23:40:39,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:39,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:39,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207093499] [2020-10-05 23:40:39,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:39,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:39,611 INFO L87 Difference]: Start difference. First operand 2250 states. Second operand 3 states. [2020-10-05 23:40:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:39,760 INFO L93 Difference]: Finished difference Result 1802 states and 6784 transitions. [2020-10-05 23:40:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:39,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:40:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:39,812 INFO L225 Difference]: With dead ends: 1802 [2020-10-05 23:40:39,812 INFO L226 Difference]: Without dead ends: 1482 [2020-10-05 23:40:39,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-10-05 23:40:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2020-10-05 23:40:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2020-10-05 23:40:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 5488 transitions. [2020-10-05 23:40:39,988 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 5488 transitions. Word has length 5 [2020-10-05 23:40:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:39,989 INFO L479 AbstractCegarLoop]: Abstraction has 1482 states and 5488 transitions. [2020-10-05 23:40:39,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 5488 transitions. [2020-10-05 23:40:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:40:39,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:39,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:39,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:40:39,996 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -900431533, now seen corresponding path program 1 times [2020-10-05 23:40:39,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:39,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38390008] [2020-10-05 23:40:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:40,215 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-05 23:40:40,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38390008] [2020-10-05 23:40:40,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:40,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:40,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513074863] [2020-10-05 23:40:40,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,220 INFO L87 Difference]: Start difference. First operand 1482 states and 5488 transitions. Second operand 3 states. [2020-10-05 23:40:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:40,256 INFO L93 Difference]: Finished difference Result 1450 states and 5344 transitions. [2020-10-05 23:40:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:40,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:40:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:40,271 INFO L225 Difference]: With dead ends: 1450 [2020-10-05 23:40:40,271 INFO L226 Difference]: Without dead ends: 1450 [2020-10-05 23:40:40,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-05 23:40:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-05 23:40:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-05 23:40:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5344 transitions. [2020-10-05 23:40:40,335 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5344 transitions. Word has length 11 [2020-10-05 23:40:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:40,336 INFO L479 AbstractCegarLoop]: Abstraction has 1450 states and 5344 transitions. [2020-10-05 23:40:40,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5344 transitions. [2020-10-05 23:40:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:40,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:40,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:40,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:40:40,342 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2143609046, now seen corresponding path program 1 times [2020-10-05 23:40:40,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:40,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569708772] [2020-10-05 23:40:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:40,440 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-05 23:40:40,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569708772] [2020-10-05 23:40:40,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:40,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:40,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986179603] [2020-10-05 23:40:40,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:40,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,443 INFO L87 Difference]: Start difference. First operand 1450 states and 5344 transitions. Second operand 3 states. [2020-10-05 23:40:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:40,464 INFO L93 Difference]: Finished difference Result 1378 states and 5038 transitions. [2020-10-05 23:40:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:40,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:40:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:40,476 INFO L225 Difference]: With dead ends: 1378 [2020-10-05 23:40:40,477 INFO L226 Difference]: Without dead ends: 1378 [2020-10-05 23:40:40,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-10-05 23:40:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2020-10-05 23:40:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2020-10-05 23:40:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 5038 transitions. [2020-10-05 23:40:40,531 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 5038 transitions. Word has length 12 [2020-10-05 23:40:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:40,531 INFO L479 AbstractCegarLoop]: Abstraction has 1378 states and 5038 transitions. [2020-10-05 23:40:40,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 5038 transitions. [2020-10-05 23:40:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:40,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:40,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:40,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:40:40,534 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:40,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash 100525783, now seen corresponding path program 1 times [2020-10-05 23:40:40,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:40,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581231344] [2020-10-05 23:40:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:40,588 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-05 23:40:40,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581231344] [2020-10-05 23:40:40,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:40,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:40:40,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515575366] [2020-10-05 23:40:40,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:40,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:40,590 INFO L87 Difference]: Start difference. First operand 1378 states and 5038 transitions. Second operand 4 states. [2020-10-05 23:40:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:40,638 INFO L93 Difference]: Finished difference Result 2098 states and 7582 transitions. [2020-10-05 23:40:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:40,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:40:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:40,651 INFO L225 Difference]: With dead ends: 2098 [2020-10-05 23:40:40,651 INFO L226 Difference]: Without dead ends: 1228 [2020-10-05 23:40:40,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-10-05 23:40:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2020-10-05 23:40:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2020-10-05 23:40:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 4462 transitions. [2020-10-05 23:40:40,700 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 4462 transitions. Word has length 13 [2020-10-05 23:40:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:40,701 INFO L479 AbstractCegarLoop]: Abstraction has 1228 states and 4462 transitions. [2020-10-05 23:40:40,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 4462 transitions. [2020-10-05 23:40:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:40,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:40,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:40,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:40:40,703 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2027412051, now seen corresponding path program 2 times [2020-10-05 23:40:40,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:40,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658072607] [2020-10-05 23:40:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:40,761 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-05 23:40:40,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658072607] [2020-10-05 23:40:40,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:40,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:40,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684653451] [2020-10-05 23:40:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:40,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,764 INFO L87 Difference]: Start difference. First operand 1228 states and 4462 transitions. Second operand 3 states. [2020-10-05 23:40:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:40,784 INFO L93 Difference]: Finished difference Result 1192 states and 4315 transitions. [2020-10-05 23:40:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:40,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:40:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:40,796 INFO L225 Difference]: With dead ends: 1192 [2020-10-05 23:40:40,796 INFO L226 Difference]: Without dead ends: 1192 [2020-10-05 23:40:40,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-10-05 23:40:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2020-10-05 23:40:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2020-10-05 23:40:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 4315 transitions. [2020-10-05 23:40:40,843 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 4315 transitions. Word has length 13 [2020-10-05 23:40:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:40,844 INFO L479 AbstractCegarLoop]: Abstraction has 1192 states and 4315 transitions. [2020-10-05 23:40:40,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 4315 transitions. [2020-10-05 23:40:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:40:40,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:40,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:40,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:40:40,846 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1574705365, now seen corresponding path program 1 times [2020-10-05 23:40:40,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:40,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874510865] [2020-10-05 23:40:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:41,104 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-05 23:40:41,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874510865] [2020-10-05 23:40:41,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:41,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:41,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533989579] [2020-10-05 23:40:41,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:40:41,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:41,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:40:41,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:41,106 INFO L87 Difference]: Start difference. First operand 1192 states and 4315 transitions. Second operand 7 states. [2020-10-05 23:40:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:41,405 INFO L93 Difference]: Finished difference Result 1232 states and 4479 transitions. [2020-10-05 23:40:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:41,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-05 23:40:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:41,417 INFO L225 Difference]: With dead ends: 1232 [2020-10-05 23:40:41,417 INFO L226 Difference]: Without dead ends: 1232 [2020-10-05 23:40:41,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-10-05 23:40:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1227. [2020-10-05 23:40:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2020-10-05 23:40:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 4461 transitions. [2020-10-05 23:40:41,470 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 4461 transitions. Word has length 14 [2020-10-05 23:40:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:41,471 INFO L479 AbstractCegarLoop]: Abstraction has 1227 states and 4461 transitions. [2020-10-05 23:40:41,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:40:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 4461 transitions. [2020-10-05 23:40:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:40:41,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:41,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:41,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:40:41,475 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash -65659995, now seen corresponding path program 1 times [2020-10-05 23:40:41,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:41,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645568047] [2020-10-05 23:40:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:41,620 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-05 23:40:41,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645568047] [2020-10-05 23:40:41,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:41,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086183433] [2020-10-05 23:40:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:41,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:41,623 INFO L87 Difference]: Start difference. First operand 1227 states and 4461 transitions. Second operand 4 states. [2020-10-05 23:40:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:41,683 INFO L93 Difference]: Finished difference Result 1282 states and 4245 transitions. [2020-10-05 23:40:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:41,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:40:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:41,692 INFO L225 Difference]: With dead ends: 1282 [2020-10-05 23:40:41,692 INFO L226 Difference]: Without dead ends: 973 [2020-10-05 23:40:41,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-10-05 23:40:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 963. [2020-10-05 23:40:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-10-05 23:40:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 3167 transitions. [2020-10-05 23:40:41,729 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 3167 transitions. Word has length 15 [2020-10-05 23:40:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:41,729 INFO L479 AbstractCegarLoop]: Abstraction has 963 states and 3167 transitions. [2020-10-05 23:40:41,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 3167 transitions. [2020-10-05 23:40:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:40:41,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:41,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:41,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:40:41,732 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1029227381, now seen corresponding path program 1 times [2020-10-05 23:40:41,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:41,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740880881] [2020-10-05 23:40:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:42,182 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-05 23:40:42,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740880881] [2020-10-05 23:40:42,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:42,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:40:42,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204567531] [2020-10-05 23:40:42,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:40:42,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:40:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:42,184 INFO L87 Difference]: Start difference. First operand 963 states and 3167 transitions. Second operand 8 states. [2020-10-05 23:40:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:42,601 INFO L93 Difference]: Finished difference Result 1092 states and 3608 transitions. [2020-10-05 23:40:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:42,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:40:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:42,611 INFO L225 Difference]: With dead ends: 1092 [2020-10-05 23:40:42,612 INFO L226 Difference]: Without dead ends: 1092 [2020-10-05 23:40:42,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:40:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2020-10-05 23:40:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1069. [2020-10-05 23:40:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2020-10-05 23:40:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 3522 transitions. [2020-10-05 23:40:42,646 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 3522 transitions. Word has length 16 [2020-10-05 23:40:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:42,647 INFO L479 AbstractCegarLoop]: Abstraction has 1069 states and 3522 transitions. [2020-10-05 23:40:42,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:40:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 3522 transitions. [2020-10-05 23:40:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:40:42,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:42,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:42,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:40:42,650 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1289795681, now seen corresponding path program 1 times [2020-10-05 23:40:42,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:42,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504034483] [2020-10-05 23:40:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:42,751 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-05 23:40:42,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504034483] [2020-10-05 23:40:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:42,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:42,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196907376] [2020-10-05 23:40:42,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:42,753 INFO L87 Difference]: Start difference. First operand 1069 states and 3522 transitions. Second operand 5 states. [2020-10-05 23:40:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:42,810 INFO L93 Difference]: Finished difference Result 947 states and 2850 transitions. [2020-10-05 23:40:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:42,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:40:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:42,817 INFO L225 Difference]: With dead ends: 947 [2020-10-05 23:40:42,817 INFO L226 Difference]: Without dead ends: 711 [2020-10-05 23:40:42,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2020-10-05 23:40:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 677. [2020-10-05 23:40:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-05 23:40:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1975 transitions. [2020-10-05 23:40:42,837 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1975 transitions. Word has length 17 [2020-10-05 23:40:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:42,838 INFO L479 AbstractCegarLoop]: Abstraction has 677 states and 1975 transitions. [2020-10-05 23:40:42,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1975 transitions. [2020-10-05 23:40:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:40:42,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:42,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:42,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:40:42,840 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash -508256966, now seen corresponding path program 1 times [2020-10-05 23:40:42,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:42,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687852710] [2020-10-05 23:40:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:43,213 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-05 23:40:43,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687852710] [2020-10-05 23:40:43,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:43,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:43,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481758527] [2020-10-05 23:40:43,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:40:43,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:43,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:40:43,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:43,216 INFO L87 Difference]: Start difference. First operand 677 states and 1975 transitions. Second operand 7 states. [2020-10-05 23:40:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:43,786 INFO L93 Difference]: Finished difference Result 2093 states and 5826 transitions. [2020-10-05 23:40:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:40:43,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:40:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:43,797 INFO L225 Difference]: With dead ends: 2093 [2020-10-05 23:40:43,798 INFO L226 Difference]: Without dead ends: 1773 [2020-10-05 23:40:43,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:40:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-10-05 23:40:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 866. [2020-10-05 23:40:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-10-05 23:40:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2497 transitions. [2020-10-05 23:40:43,833 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2497 transitions. Word has length 19 [2020-10-05 23:40:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:43,833 INFO L479 AbstractCegarLoop]: Abstraction has 866 states and 2497 transitions. [2020-10-05 23:40:43,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:40:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2497 transitions. [2020-10-05 23:40:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:40:43,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:43,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:43,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:40:43,836 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 50473239, now seen corresponding path program 1 times [2020-10-05 23:40:43,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:43,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855943419] [2020-10-05 23:40:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:43,951 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-05 23:40:43,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855943419] [2020-10-05 23:40:43,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:43,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:43,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538336595] [2020-10-05 23:40:43,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:43,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:43,953 INFO L87 Difference]: Start difference. First operand 866 states and 2497 transitions. Second operand 6 states. [2020-10-05 23:40:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:44,022 INFO L93 Difference]: Finished difference Result 759 states and 2143 transitions. [2020-10-05 23:40:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:44,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:40:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:44,028 INFO L225 Difference]: With dead ends: 759 [2020-10-05 23:40:44,028 INFO L226 Difference]: Without dead ends: 656 [2020-10-05 23:40:44,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-10-05 23:40:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 632. [2020-10-05 23:40:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2020-10-05 23:40:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1806 transitions. [2020-10-05 23:40:44,045 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1806 transitions. Word has length 19 [2020-10-05 23:40:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:44,046 INFO L479 AbstractCegarLoop]: Abstraction has 632 states and 1806 transitions. [2020-10-05 23:40:44,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1806 transitions. [2020-10-05 23:40:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:40:44,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:44,048 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-05 23:40:44,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:40:44,049 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:44,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash -172828862, now seen corresponding path program 1 times [2020-10-05 23:40:44,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:44,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981814739] [2020-10-05 23:40:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:44,174 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-05 23:40:44,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981814739] [2020-10-05 23:40:44,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:44,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:40:44,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840020133] [2020-10-05 23:40:44,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:40:44,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:40:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:44,177 INFO L87 Difference]: Start difference. First operand 632 states and 1806 transitions. Second operand 7 states. [2020-10-05 23:40:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:44,257 INFO L93 Difference]: Finished difference Result 607 states and 1754 transitions. [2020-10-05 23:40:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:40:44,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:40:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:44,261 INFO L225 Difference]: With dead ends: 607 [2020-10-05 23:40:44,262 INFO L226 Difference]: Without dead ends: 480 [2020-10-05 23:40:44,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-10-05 23:40:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 472. [2020-10-05 23:40:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-05 23:40:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1371 transitions. [2020-10-05 23:40:44,274 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1371 transitions. Word has length 21 [2020-10-05 23:40:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:44,275 INFO L479 AbstractCegarLoop]: Abstraction has 472 states and 1371 transitions. [2020-10-05 23:40:44,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:40:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1371 transitions. [2020-10-05 23:40:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:44,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:44,277 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, 1, 1, 1] [2020-10-05 23:40:44,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:40:44,277 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash 552926790, now seen corresponding path program 1 times [2020-10-05 23:40:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:44,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529386793] [2020-10-05 23:40:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:44,342 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-05 23:40:44,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529386793] [2020-10-05 23:40:44,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:44,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:40:44,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506807693] [2020-10-05 23:40:44,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:44,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:44,345 INFO L87 Difference]: Start difference. First operand 472 states and 1371 transitions. Second operand 3 states. [2020-10-05 23:40:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:44,363 INFO L93 Difference]: Finished difference Result 636 states and 1823 transitions. [2020-10-05 23:40:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:44,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-05 23:40:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:44,366 INFO L225 Difference]: With dead ends: 636 [2020-10-05 23:40:44,366 INFO L226 Difference]: Without dead ends: 366 [2020-10-05 23:40:44,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-10-05 23:40:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2020-10-05 23:40:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-10-05 23:40:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1034 transitions. [2020-10-05 23:40:44,376 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1034 transitions. Word has length 24 [2020-10-05 23:40:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:44,376 INFO L479 AbstractCegarLoop]: Abstraction has 366 states and 1034 transitions. [2020-10-05 23:40:44,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1034 transitions. [2020-10-05 23:40:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:44,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:44,378 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, 1, 1, 1] [2020-10-05 23:40:44,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:40:44,378 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -272845718, now seen corresponding path program 2 times [2020-10-05 23:40:44,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:44,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474564782] [2020-10-05 23:40:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:44,490 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-05 23:40:44,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474564782] [2020-10-05 23:40:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:44,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:44,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657283061] [2020-10-05 23:40:44,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:44,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:44,494 INFO L87 Difference]: Start difference. First operand 366 states and 1034 transitions. Second operand 4 states. [2020-10-05 23:40:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:44,516 INFO L93 Difference]: Finished difference Result 485 states and 1354 transitions. [2020-10-05 23:40:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:44,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-05 23:40:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:44,519 INFO L225 Difference]: With dead ends: 485 [2020-10-05 23:40:44,519 INFO L226 Difference]: Without dead ends: 249 [2020-10-05 23:40:44,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-05 23:40:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-10-05 23:40:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-10-05 23:40:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 632 transitions. [2020-10-05 23:40:44,526 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 632 transitions. Word has length 24 [2020-10-05 23:40:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:44,527 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 632 transitions. [2020-10-05 23:40:44,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 632 transitions. [2020-10-05 23:40:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:44,528 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:44,528 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, 1, 1, 1] [2020-10-05 23:40:44,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:40:44,528 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash -4480626, now seen corresponding path program 3 times [2020-10-05 23:40:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:44,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725051478] [2020-10-05 23:40:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:44,943 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-10-05 23:40:45,098 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-10-05 23:40:45,351 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-05 23:40:45,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725051478] [2020-10-05 23:40:45,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:45,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:40:45,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908977629] [2020-10-05 23:40:45,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:40:45,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:40:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:40:45,353 INFO L87 Difference]: Start difference. First operand 249 states and 632 transitions. Second operand 10 states. [2020-10-05 23:40:45,839 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-05 23:40:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:45,945 INFO L93 Difference]: Finished difference Result 463 states and 1169 transitions. [2020-10-05 23:40:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:40:45,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-05 23:40:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:45,948 INFO L225 Difference]: With dead ends: 463 [2020-10-05 23:40:45,949 INFO L226 Difference]: Without dead ends: 376 [2020-10-05 23:40:45,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:40:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-05 23:40:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 305. [2020-10-05 23:40:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-10-05 23:40:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 780 transitions. [2020-10-05 23:40:45,960 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 780 transitions. Word has length 24 [2020-10-05 23:40:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:45,961 INFO L479 AbstractCegarLoop]: Abstraction has 305 states and 780 transitions. [2020-10-05 23:40:45,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:40:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 780 transitions. [2020-10-05 23:40:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:45,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:45,964 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, 1, 1, 1] [2020-10-05 23:40:45,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:40:45,965 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:45,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2004667446, now seen corresponding path program 4 times [2020-10-05 23:40:45,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:45,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254802815] [2020-10-05 23:40:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:46,518 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-10-05 23:40:46,636 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-10-05 23:40:46,769 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-10-05 23:40:47,445 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-05 23:40:47,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254802815] [2020-10-05 23:40:47,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:47,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-05 23:40:47,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435832557] [2020-10-05 23:40:47,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-05 23:40:47,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-05 23:40:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:40:47,448 INFO L87 Difference]: Start difference. First operand 305 states and 780 transitions. Second operand 15 states. [2020-10-05 23:40:47,655 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-10-05 23:40:47,858 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-10-05 23:40:48,870 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-10-05 23:40:49,040 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-10-05 23:40:49,183 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-10-05 23:40:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:49,690 INFO L93 Difference]: Finished difference Result 491 states and 1287 transitions. [2020-10-05 23:40:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:40:49,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-10-05 23:40:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:49,693 INFO L225 Difference]: With dead ends: 491 [2020-10-05 23:40:49,693 INFO L226 Difference]: Without dead ends: 446 [2020-10-05 23:40:49,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:40:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-10-05 23:40:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 373. [2020-10-05 23:40:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-05 23:40:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 975 transitions. [2020-10-05 23:40:49,703 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 975 transitions. Word has length 24 [2020-10-05 23:40:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:49,704 INFO L479 AbstractCegarLoop]: Abstraction has 373 states and 975 transitions. [2020-10-05 23:40:49,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-05 23:40:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 975 transitions. [2020-10-05 23:40:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:49,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:49,705 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, 1, 1, 1] [2020-10-05 23:40:49,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:40:49,706 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1746587700, now seen corresponding path program 5 times [2020-10-05 23:40:49,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:49,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690083781] [2020-10-05 23:40:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:50,184 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2020-10-05 23:40:50,363 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2020-10-05 23:40:50,549 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2020-10-05 23:40:50,793 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2020-10-05 23:40:50,976 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-10-05 23:40:51,414 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-05 23:40:51,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690083781] [2020-10-05 23:40:51,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:51,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-05 23:40:51,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873758803] [2020-10-05 23:40:51,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-05 23:40:51,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-05 23:40:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:40:51,417 INFO L87 Difference]: Start difference. First operand 373 states and 975 transitions. Second operand 15 states. [2020-10-05 23:40:51,666 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2020-10-05 23:40:51,994 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2020-10-05 23:40:52,900 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-10-05 23:40:53,126 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-10-05 23:40:53,417 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-10-05 23:40:53,581 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-10-05 23:40:53,733 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-10-05 23:40:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:54,310 INFO L93 Difference]: Finished difference Result 522 states and 1344 transitions. [2020-10-05 23:40:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-05 23:40:54,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-10-05 23:40:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:54,313 INFO L225 Difference]: With dead ends: 522 [2020-10-05 23:40:54,313 INFO L226 Difference]: Without dead ends: 485 [2020-10-05 23:40:54,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2020-10-05 23:40:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-10-05 23:40:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 363. [2020-10-05 23:40:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-05 23:40:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 922 transitions. [2020-10-05 23:40:54,324 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 922 transitions. Word has length 24 [2020-10-05 23:40:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:54,325 INFO L479 AbstractCegarLoop]: Abstraction has 363 states and 922 transitions. [2020-10-05 23:40:54,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-05 23:40:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 922 transitions. [2020-10-05 23:40:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:54,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:54,326 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, 1, 1, 1] [2020-10-05 23:40:54,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:40:54,327 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -722668682, now seen corresponding path program 6 times [2020-10-05 23:40:54,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:54,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080998107] [2020-10-05 23:40:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:54,894 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2020-10-05 23:40:55,753 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-05 23:40:55,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080998107] [2020-10-05 23:40:55,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:55,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-05 23:40:55,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110146032] [2020-10-05 23:40:55,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:40:55,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:40:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:40:55,759 INFO L87 Difference]: Start difference. First operand 363 states and 922 transitions. Second operand 16 states. [2020-10-05 23:40:56,790 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-10-05 23:40:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:57,917 INFO L93 Difference]: Finished difference Result 512 states and 1270 transitions. [2020-10-05 23:40:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:40:57,918 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2020-10-05 23:40:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:57,919 INFO L225 Difference]: With dead ends: 512 [2020-10-05 23:40:57,919 INFO L226 Difference]: Without dead ends: 484 [2020-10-05 23:40:57,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2020-10-05 23:40:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-10-05 23:40:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 403. [2020-10-05 23:40:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-05 23:40:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1026 transitions. [2020-10-05 23:40:57,930 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1026 transitions. Word has length 24 [2020-10-05 23:40:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:57,931 INFO L479 AbstractCegarLoop]: Abstraction has 403 states and 1026 transitions. [2020-10-05 23:40:57,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:40:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1026 transitions. [2020-10-05 23:40:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:40:57,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:57,932 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, 1, 1, 1] [2020-10-05 23:40:57,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:40:57,933 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2132798668, now seen corresponding path program 7 times [2020-10-05 23:40:57,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:57,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568354529] [2020-10-05 23:40:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:58,654 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-05 23:40:58,926 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-10-05 23:40:59,137 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2020-10-05 23:40:59,375 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2020-10-05 23:40:59,489 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-05 23:40:59,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568354529] [2020-10-05 23:40:59,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:59,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:40:59,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962808553] [2020-10-05 23:40:59,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:40:59,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:40:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:40:59,491 INFO L87 Difference]: Start difference. First operand 403 states and 1026 transitions. Second operand 10 states. [2020-10-05 23:41:00,016 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-10-05 23:41:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:00,088 INFO L93 Difference]: Finished difference Result 570 states and 1419 transitions. [2020-10-05 23:41:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:41:00,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-05 23:41:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:00,091 INFO L225 Difference]: With dead ends: 570 [2020-10-05 23:41:00,091 INFO L226 Difference]: Without dead ends: 422 [2020-10-05 23:41:00,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:41:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-05 23:41:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 301. [2020-10-05 23:41:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-05 23:41:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 767 transitions. [2020-10-05 23:41:00,100 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 767 transitions. Word has length 24 [2020-10-05 23:41:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:00,100 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 767 transitions. [2020-10-05 23:41:00,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:41:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 767 transitions. [2020-10-05 23:41:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:41:00,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:00,102 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, 1, 1, 1] [2020-10-05 23:41:00,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:41:00,102 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash 312078982, now seen corresponding path program 8 times [2020-10-05 23:41:00,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:00,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091885780] [2020-10-05 23:41:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:41:00,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:41:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:41:00,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:41:00,391 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:41:00,391 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:41:00,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:41:00,393 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:41:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1789] [1789] L3-->L889: Formula: (let ((.cse8 (= (mod ~x$r_buff0_thd0~0_In-1161704568 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-1161704568 256) 0)) (.cse10 (= (mod ~x$w_buff1_used~0_In-1161704568 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-1161704568 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse10)) (.cse2 (or .cse9 .cse10)) (.cse5 (or .cse8 .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse7))) (and (= ~x$r_buff1_thd0~0_In-1161704568 ~x$r_buff1_thd0~0_Out-1161704568) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1161704568 0)) (or (and (= 0 ~x$w_buff1_used~0_Out-1161704568) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_In-1161704568 ~x$w_buff1_used~0_Out-1161704568))) (or (and (= ~x$w_buff0_used~0_Out-1161704568 0) .cse3 .cse4) (and .cse5 (= ~x$w_buff0_used~0_In-1161704568 ~x$w_buff0_used~0_Out-1161704568))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1161704568| ULTIMATE.start_assume_abort_if_not_~cond_Out-1161704568) (let ((.cse6 (select |#memory_int_In-1161704568| |~#x~0.base_In-1161704568|))) (or (and (or (and (= (store |#memory_int_In-1161704568| |~#x~0.base_In-1161704568| (store .cse6 |~#x~0.offset_In-1161704568| ~x$w_buff1~0_In-1161704568)) |#memory_int_Out-1161704568|) .cse0 .cse1) (and .cse2 (= (store |#memory_int_In-1161704568| |~#x~0.base_In-1161704568| (store .cse6 |~#x~0.offset_In-1161704568| (select .cse6 |~#x~0.offset_In-1161704568|))) |#memory_int_Out-1161704568|))) .cse5) (and .cse3 .cse4 (= (store |#memory_int_In-1161704568| |~#x~0.base_In-1161704568| (store .cse6 |~#x~0.offset_In-1161704568| ~x$w_buff0~0_In-1161704568)) |#memory_int_Out-1161704568|)))) (= ~x$r_buff0_thd0~0_Out-1161704568 ~x$r_buff0_thd0~0_In-1161704568)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1161704568, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1161704568, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1161704568|, ~#x~0.offset=|~#x~0.offset_In-1161704568|, ~x$w_buff1~0=~x$w_buff1~0_In-1161704568, #memory_int=|#memory_int_In-1161704568|, ~#x~0.base=|~#x~0.base_In-1161704568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1161704568, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1161704568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161704568} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1161704568, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1161704568, ~#x~0.offset=|~#x~0.offset_In-1161704568|, ~x$w_buff1~0=~x$w_buff1~0_In-1161704568, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1161704568, ULTIMATE.start_main_#t~ite104=|ULTIMATE.start_main_#t~ite104_Out-1161704568|, ULTIMATE.start_main_#t~ite105=|ULTIMATE.start_main_#t~ite105_Out-1161704568|, ULTIMATE.start_main_#t~ite106=|ULTIMATE.start_main_#t~ite106_Out-1161704568|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1161704568, ULTIMATE.start_main_#t~ite107=|ULTIMATE.start_main_#t~ite107_Out-1161704568|, ULTIMATE.start_main_#t~ite108=|ULTIMATE.start_main_#t~ite108_Out-1161704568|, ULTIMATE.start_main_#t~ite109=|ULTIMATE.start_main_#t~ite109_Out-1161704568|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1161704568, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1161704568|, ULTIMATE.start_main_#t~mem103=|ULTIMATE.start_main_#t~mem103_Out-1161704568|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1161704568, #memory_int=|#memory_int_Out-1161704568|, ~#x~0.base=|~#x~0.base_In-1161704568|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite104, ULTIMATE.start_main_#t~ite105, ULTIMATE.start_main_#t~ite106, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite107, ULTIMATE.start_main_#t~ite108, ULTIMATE.start_main_#t~ite109, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem103, ULTIMATE.start_assume_abort_if_not_~cond, #memory_int] because there is no mapped edge [2020-10-05 23:41:00,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,492 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,493 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,494 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,494 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,496 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,496 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,497 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,497 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,499 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,502 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,502 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:00,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:00,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:41:00 BasicIcfg [2020-10-05 23:41:00,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:41:00,603 INFO L168 Benchmark]: Toolchain (without parser) took 37166.14 ms. Allocated memory was 144.7 MB in the beginning and 608.2 MB in the end (delta: 463.5 MB). Free memory was 99.6 MB in the beginning and 245.7 MB in the end (delta: -146.1 MB). Peak memory consumption was 317.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,603 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 144.7 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.32 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.38 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,605 INFO L168 Benchmark]: Boogie Preprocessor took 73.18 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 143.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,606 INFO L168 Benchmark]: RCFGBuilder took 3963.03 ms. Allocated memory was 202.9 MB in the beginning and 306.7 MB in the end (delta: 103.8 MB). Free memory was 143.8 MB in the beginning and 208.8 MB in the end (delta: -65.0 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,606 INFO L168 Benchmark]: TraceAbstraction took 32128.14 ms. Allocated memory was 306.7 MB in the beginning and 608.2 MB in the end (delta: 301.5 MB). Free memory was 208.8 MB in the beginning and 245.7 MB in the end (delta: -36.8 MB). Peak memory consumption was 264.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:00,609 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.39 ms. Allocated memory is still 144.7 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 927.32 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.38 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.18 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 143.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3963.03 ms. Allocated memory was 202.9 MB in the beginning and 306.7 MB in the end (delta: 103.8 MB). Free memory was 143.8 MB in the beginning and 208.8 MB in the end (delta: -65.0 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32128.14 ms. Allocated memory was 306.7 MB in the beginning and 608.2 MB in the end (delta: 301.5 MB). Free memory was 208.8 MB in the beginning and 245.7 MB in the end (delta: -36.8 MB). Peak memory consumption was 264.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.5s, 137 ProgramPointsBefore, 43 ProgramPointsAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 1134 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5128 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L704] 0 int __unbuffered_p0_EBX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L707] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L708] 0 int __unbuffered_p2_EAX$mem_tmp; [L709] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L710] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L711] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L712] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L713] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L714] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L719] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L720] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L721] 0 int __unbuffered_p2_EAX$w_buff0; [L722] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L723] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L729] 0 _Bool x$flush_delayed; [L730] 0 int x$mem_tmp; [L731] 0 _Bool x$r_buff0_thd0; [L732] 0 _Bool x$r_buff0_thd1; [L733] 0 _Bool x$r_buff0_thd2; [L734] 0 _Bool x$r_buff0_thd3; [L735] 0 _Bool x$r_buff0_thd4; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$r_buff1_thd3; [L740] 0 _Bool x$r_buff1_thd4; [L741] 0 _Bool x$read_delayed; [L742] 0 int *x$read_delayed_var; [L743] 0 int x$w_buff0; [L744] 0 _Bool x$w_buff0_used; [L745] 0 int x$w_buff1; [L746] 0 _Bool x$w_buff1_used; [L748] 0 int y = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice1; [L751] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2229; [L872] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L873] 0 pthread_t t2230; [L874] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 1 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L793] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2231; [L876] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2232; [L878] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 x$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(x) [L813] 3 x$mem_tmp = x [L814] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L816] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L818] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] EXPR 3 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 1 x$flush_delayed = weak$$choice2 [L761] EXPR 1 \read(x) [L761] 1 x$mem_tmp = x [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0 [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L765] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L767] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L768] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 \read(x) [L769] 1 __unbuffered_p0_EBX = x [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] EXPR 1 \read(x) [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] 1 x = x$flush_delayed ? x$mem_tmp : x [L771] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L800] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 125 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 572 SDtfs, 570 SDslu, 2128 SDs, 0 SdLazy, 3973 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2250occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 1479 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 161187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...