/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:54:56,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:54:56,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:54:56,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:54:56,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:54:56,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:54:56,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:54:56,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:54:56,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:54:56,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:54:56,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:54:56,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:54:56,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:54:56,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:54:56,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:54:56,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:54:56,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:54:56,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:54:56,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:54:56,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:54:56,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:54:56,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:54:56,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:54:56,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:54:56,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:54:56,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:54:56,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:54:56,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:54:56,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:54:56,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:54:56,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:54:56,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:54:56,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:54:56,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:54:56,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:54:56,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:54:56,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:54:56,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:54:56,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:54:56,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:54:56,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:54:56,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:54:56,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:54:56,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:54:56,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:54:56,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:54:56,325 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:54:56,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:54:56,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:54:56,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:54:56,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:54:56,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:54:56,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:54:56,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:54:56,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:54:56,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:54:56,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:54:56,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:54:56,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:54:56,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:54:56,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:54:56,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:54:56,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:54:56,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:54:56,331 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:54:56,331 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:54:56,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:54:56,332 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:54:56,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:54:56,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:54:56,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:54:56,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:54:56,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:54:56,675 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:54:56,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 20:54:56,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2aa9ce3d/63e99f3149d143679ece0865e2480f10/FLAGc0160b80f [2019-12-27 20:54:57,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:54:57,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 20:54:57,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2aa9ce3d/63e99f3149d143679ece0865e2480f10/FLAGc0160b80f [2019-12-27 20:54:57,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2aa9ce3d/63e99f3149d143679ece0865e2480f10 [2019-12-27 20:54:57,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:54:57,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:54:57,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:57,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:54:57,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:54:57,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:57" (1/1) ... [2019-12-27 20:54:57,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be7c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:57, skipping insertion in model container [2019-12-27 20:54:57,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:57" (1/1) ... [2019-12-27 20:54:57,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:54:57,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:54:58,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:58,304 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:54:58,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:58,468 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:54:58,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58 WrapperNode [2019-12-27 20:54:58,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:58,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:58,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:54:58,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:54:58,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:58,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:54:58,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:54:58,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:54:58,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... [2019-12-27 20:54:58,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:54:58,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:54:58,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:54:58,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:54:58,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:54:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:54:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:54:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:54:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:54:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:54:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:54:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:54:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:54:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:54:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:54:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:54:58,628 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:54:59,318 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:54:59,318 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:54:59,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:59 BoogieIcfgContainer [2019-12-27 20:54:59,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:54:59,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:54:59,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:54:59,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:54:59,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:54:57" (1/3) ... [2019-12-27 20:54:59,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:59, skipping insertion in model container [2019-12-27 20:54:59,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:58" (2/3) ... [2019-12-27 20:54:59,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:59, skipping insertion in model container [2019-12-27 20:54:59,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:59" (3/3) ... [2019-12-27 20:54:59,328 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-27 20:54:59,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:54:59,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:54:59,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:54:59,347 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:54:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,458 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:59,473 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:54:59,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:54:59,493 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:54:59,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:54:59,493 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:54:59,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:54:59,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:54:59,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:54:59,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:54:59,510 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 20:54:59,512 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:54:59,604 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:54:59,604 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:59,620 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:54:59,644 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:54:59,689 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:54:59,689 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:59,695 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:54:59,709 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:54:59,710 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:55:02,882 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:55:02,996 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:55:03,195 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:03,336 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:03,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 20:55:03,356 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:55:03,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 20:55:03,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 20:55:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 20:55:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:55:03,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:03,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:55:03,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 20:55:03,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:03,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504071288] [2019-12-27 20:55:03,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504071288] [2019-12-27 20:55:04,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:04,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:55:04,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613936839] [2019-12-27 20:55:04,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:04,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:04,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:55:04,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:04,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:04,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:04,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:04,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:04,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:04,145 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 20:55:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:04,437 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 20:55:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:04,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:55:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:04,535 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 20:55:04,535 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 20:55:04,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 20:55:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 20:55:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 20:55:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 20:55:05,131 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 20:55:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:05,132 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 20:55:05,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 20:55:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:55:05,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:05,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:05,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 20:55:05,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:05,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113426833] [2019-12-27 20:55:05,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:05,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113426833] [2019-12-27 20:55:05,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:05,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:05,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553188810] [2019-12-27 20:55:05,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:05,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:05,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:55:05,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:05,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:05,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:05,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:05,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:05,200 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 20:55:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:05,237 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 20:55:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:05,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:55:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:05,246 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 20:55:05,246 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 20:55:05,247 INFO L631 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 [2019-12-27 20:55:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 20:55:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 20:55:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 20:55:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 20:55:05,291 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 20:55:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:05,291 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 20:55:05,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 20:55:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:05,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:05,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:05,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 20:55:05,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:05,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543655206] [2019-12-27 20:55:05,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:05,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543655206] [2019-12-27 20:55:05,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:05,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:05,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867675474] [2019-12-27 20:55:05,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:05,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:05,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:05,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:05,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:05,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:05,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:05,436 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 20:55:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:05,513 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 20:55:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:05,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:55:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:05,526 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 20:55:05,526 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 20:55:05,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 20:55:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 20:55:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 20:55:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 20:55:05,576 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 20:55:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:05,576 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 20:55:05,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 20:55:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:05,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:05,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:05,579 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 20:55:05,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:05,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529288034] [2019-12-27 20:55:05,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:05,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529288034] [2019-12-27 20:55:05,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:05,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:05,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1401447796] [2019-12-27 20:55:05,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:05,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:05,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:05,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:05,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:05,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:05,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:05,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:05,694 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 20:55:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:05,891 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 20:55:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:05,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:55:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:05,903 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 20:55:05,903 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 20:55:05,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 20:55:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 20:55:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 20:55:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 20:55:05,953 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 20:55:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:05,953 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 20:55:05,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 20:55:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:05,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:05,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:05,955 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 20:55:05,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:05,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493350504] [2019-12-27 20:55:05,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:06,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493350504] [2019-12-27 20:55:06,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:06,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:06,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709668121] [2019-12-27 20:55:06,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:06,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:06,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:06,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:06,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:06,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:06,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:06,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:06,042 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 20:55:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:06,220 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 20:55:06,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:06,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:55:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:06,237 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 20:55:06,237 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 20:55:06,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 20:55:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 20:55:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 20:55:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 20:55:06,338 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 20:55:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:06,338 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 20:55:06,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 20:55:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:55:06,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:06,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:06,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 20:55:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:06,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822446805] [2019-12-27 20:55:06,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:06,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822446805] [2019-12-27 20:55:06,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:06,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:06,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469175939] [2019-12-27 20:55:06,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:06,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:06,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:55:06,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:06,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:06,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:06,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:06,416 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 20:55:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:06,696 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 20:55:06,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:06,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:55:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:06,722 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 20:55:06,723 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 20:55:06,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 20:55:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 20:55:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 20:55:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 20:55:06,788 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 20:55:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:06,789 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 20:55:06,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 20:55:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:06,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:06,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:06,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:06,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 20:55:06,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:06,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580575800] [2019-12-27 20:55:06,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:06,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580575800] [2019-12-27 20:55:06,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:06,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:06,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877952098] [2019-12-27 20:55:06,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:06,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:06,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:55:06,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:06,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:06,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:06,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:06,926 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 5 states. [2019-12-27 20:55:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:06,952 INFO L93 Difference]: Finished difference Result 1117 states and 2441 transitions. [2019-12-27 20:55:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:06,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:06,957 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 20:55:06,957 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 20:55:06,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 20:55:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1059. [2019-12-27 20:55:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 20:55:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2334 transitions. [2019-12-27 20:55:06,986 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2334 transitions. Word has length 26 [2019-12-27 20:55:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:06,986 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2334 transitions. [2019-12-27 20:55:06,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2334 transitions. [2019-12-27 20:55:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:06,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:06,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:06,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 20:55:06,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:06,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109530459] [2019-12-27 20:55:06,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:07,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109530459] [2019-12-27 20:55:07,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:07,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:07,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203554145] [2019-12-27 20:55:07,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:07,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:07,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:55:07,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:07,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:07,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:07,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:07,082 INFO L87 Difference]: Start difference. First operand 1059 states and 2334 transitions. Second operand 5 states. [2019-12-27 20:55:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:07,277 INFO L93 Difference]: Finished difference Result 1193 states and 2576 transitions. [2019-12-27 20:55:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:07,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:07,281 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 20:55:07,281 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 20:55:07,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 20:55:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 955. [2019-12-27 20:55:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-27 20:55:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2121 transitions. [2019-12-27 20:55:07,309 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2121 transitions. Word has length 26 [2019-12-27 20:55:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:07,310 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 2121 transitions. [2019-12-27 20:55:07,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2121 transitions. [2019-12-27 20:55:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:07,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:07,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:07,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:07,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 15300526, now seen corresponding path program 1 times [2019-12-27 20:55:07,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:07,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474201404] [2019-12-27 20:55:07,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:07,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474201404] [2019-12-27 20:55:07,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:07,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:07,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054154391] [2019-12-27 20:55:07,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:07,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:07,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 145 transitions. [2019-12-27 20:55:07,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:07,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:07,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:55:07,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:55:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:07,561 INFO L87 Difference]: Start difference. First operand 955 states and 2121 transitions. Second operand 7 states. [2019-12-27 20:55:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:07,871 INFO L93 Difference]: Finished difference Result 2800 states and 6130 transitions. [2019-12-27 20:55:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:55:07,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 20:55:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:07,876 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 20:55:07,876 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 20:55:07,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:55:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 20:55:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1056. [2019-12-27 20:55:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 20:55:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2353 transitions. [2019-12-27 20:55:07,906 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2353 transitions. Word has length 51 [2019-12-27 20:55:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:07,907 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2353 transitions. [2019-12-27 20:55:07,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:55:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2353 transitions. [2019-12-27 20:55:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:07,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:07,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:07,910 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash -671171562, now seen corresponding path program 2 times [2019-12-27 20:55:07,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:07,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796237318] [2019-12-27 20:55:07,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:07,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796237318] [2019-12-27 20:55:07,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:07,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:07,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221279695] [2019-12-27 20:55:07,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:07,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:08,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 133 transitions. [2019-12-27 20:55:08,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:08,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:55:08,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:08,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:08,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:08,077 INFO L87 Difference]: Start difference. First operand 1056 states and 2353 transitions. Second operand 6 states. [2019-12-27 20:55:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:08,210 INFO L93 Difference]: Finished difference Result 1843 states and 4120 transitions. [2019-12-27 20:55:08,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:55:08,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 20:55:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:08,253 INFO L225 Difference]: With dead ends: 1843 [2019-12-27 20:55:08,253 INFO L226 Difference]: Without dead ends: 789 [2019-12-27 20:55:08,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:55:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-27 20:55:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 622. [2019-12-27 20:55:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-27 20:55:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1432 transitions. [2019-12-27 20:55:08,269 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1432 transitions. Word has length 51 [2019-12-27 20:55:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:08,269 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1432 transitions. [2019-12-27 20:55:08,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1432 transitions. [2019-12-27 20:55:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:08,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:08,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:08,272 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 3 times [2019-12-27 20:55:08,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:08,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572503125] [2019-12-27 20:55:08,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:08,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572503125] [2019-12-27 20:55:08,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:08,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:55:08,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182273623] [2019-12-27 20:55:08,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:08,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:08,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-27 20:55:08,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:08,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:55:08,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:08,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:08,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:08,514 INFO L87 Difference]: Start difference. First operand 622 states and 1432 transitions. Second operand 5 states. [2019-12-27 20:55:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:08,742 INFO L93 Difference]: Finished difference Result 743 states and 1651 transitions. [2019-12-27 20:55:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:55:08,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 20:55:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:08,746 INFO L225 Difference]: With dead ends: 743 [2019-12-27 20:55:08,746 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 20:55:08,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 20:55:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2019-12-27 20:55:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-27 20:55:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1584 transitions. [2019-12-27 20:55:08,763 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1584 transitions. Word has length 51 [2019-12-27 20:55:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:08,764 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1584 transitions. [2019-12-27 20:55:08,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1584 transitions. [2019-12-27 20:55:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:08,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:08,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:08,766 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash 440616472, now seen corresponding path program 4 times [2019-12-27 20:55:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:08,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274748033] [2019-12-27 20:55:08,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:08,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274748033] [2019-12-27 20:55:08,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:08,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:08,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797650965] [2019-12-27 20:55:08,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:08,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:08,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 93 transitions. [2019-12-27 20:55:08,973 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:08,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:08,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:08,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:08,975 INFO L87 Difference]: Start difference. First operand 705 states and 1584 transitions. Second operand 3 states. [2019-12-27 20:55:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:08,993 INFO L93 Difference]: Finished difference Result 704 states and 1582 transitions. [2019-12-27 20:55:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:08,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:55:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:08,995 INFO L225 Difference]: With dead ends: 704 [2019-12-27 20:55:08,995 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 20:55:08,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 20:55:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 631. [2019-12-27 20:55:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 20:55:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1452 transitions. [2019-12-27 20:55:09,009 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1452 transitions. Word has length 51 [2019-12-27 20:55:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:09,010 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1452 transitions. [2019-12-27 20:55:09,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1452 transitions. [2019-12-27 20:55:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:55:09,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:09,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:09,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 578834260, now seen corresponding path program 1 times [2019-12-27 20:55:09,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:09,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816239967] [2019-12-27 20:55:09,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:09,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816239967] [2019-12-27 20:55:09,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:09,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:55:09,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006789417] [2019-12-27 20:55:09,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:09,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:09,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 20:55:09,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:09,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:55:09,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:55:09,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:55:09,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:55:09,314 INFO L87 Difference]: Start difference. First operand 631 states and 1452 transitions. Second operand 9 states. [2019-12-27 20:55:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:10,047 INFO L93 Difference]: Finished difference Result 1208 states and 2549 transitions. [2019-12-27 20:55:10,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:55:10,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:55:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:10,050 INFO L225 Difference]: With dead ends: 1208 [2019-12-27 20:55:10,050 INFO L226 Difference]: Without dead ends: 1208 [2019-12-27 20:55:10,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:55:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-12-27 20:55:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 746. [2019-12-27 20:55:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 20:55:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1598 transitions. [2019-12-27 20:55:10,069 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1598 transitions. Word has length 52 [2019-12-27 20:55:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:10,069 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1598 transitions. [2019-12-27 20:55:10,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:55:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1598 transitions. [2019-12-27 20:55:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:55:10,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:10,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:10,072 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash -717714874, now seen corresponding path program 2 times [2019-12-27 20:55:10,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:10,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835860474] [2019-12-27 20:55:10,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835860474] [2019-12-27 20:55:10,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:10,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:10,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805053187] [2019-12-27 20:55:10,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:10,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:10,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 93 transitions. [2019-12-27 20:55:10,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:10,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:10,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:10,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:10,279 INFO L87 Difference]: Start difference. First operand 746 states and 1598 transitions. Second operand 4 states. [2019-12-27 20:55:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:10,350 INFO L93 Difference]: Finished difference Result 910 states and 1926 transitions. [2019-12-27 20:55:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:10,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:55:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:10,352 INFO L225 Difference]: With dead ends: 910 [2019-12-27 20:55:10,353 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 20:55:10,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 20:55:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 760. [2019-12-27 20:55:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 20:55:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1629 transitions. [2019-12-27 20:55:10,373 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1629 transitions. Word has length 52 [2019-12-27 20:55:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:10,374 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1629 transitions. [2019-12-27 20:55:10,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1629 transitions. [2019-12-27 20:55:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:10,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:10,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:10,377 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1517325742, now seen corresponding path program 1 times [2019-12-27 20:55:10,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:10,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910735514] [2019-12-27 20:55:10,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:10,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910735514] [2019-12-27 20:55:10,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:10,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:10,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124983875] [2019-12-27 20:55:10,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:10,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:10,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 145 transitions. [2019-12-27 20:55:10,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:10,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:55:10,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:55:10,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:55:10,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:55:10,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:55:10,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:55:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:55:10,896 INFO L87 Difference]: Start difference. First operand 760 states and 1629 transitions. Second operand 11 states. [2019-12-27 20:55:12,110 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 20:55:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:16,324 INFO L93 Difference]: Finished difference Result 4633 states and 9380 transitions. [2019-12-27 20:55:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 20:55:16,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 20:55:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:16,332 INFO L225 Difference]: With dead ends: 4633 [2019-12-27 20:55:16,333 INFO L226 Difference]: Without dead ends: 2622 [2019-12-27 20:55:16,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 20:55:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-12-27 20:55:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 863. [2019-12-27 20:55:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-27 20:55:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1837 transitions. [2019-12-27 20:55:16,373 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1837 transitions. Word has length 53 [2019-12-27 20:55:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1837 transitions. [2019-12-27 20:55:16,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:55:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1837 transitions. [2019-12-27 20:55:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:16,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:16,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:16,376 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1731920874, now seen corresponding path program 2 times [2019-12-27 20:55:16,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:16,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296604689] [2019-12-27 20:55:16,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:16,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296604689] [2019-12-27 20:55:16,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:16,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:55:16,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387858781] [2019-12-27 20:55:16,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:16,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:16,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:55:16,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:16,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:55:16,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:16,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:16,659 INFO L87 Difference]: Start difference. First operand 863 states and 1837 transitions. Second operand 6 states. [2019-12-27 20:55:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:17,048 INFO L93 Difference]: Finished difference Result 1694 states and 3595 transitions. [2019-12-27 20:55:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:55:17,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 20:55:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:17,053 INFO L225 Difference]: With dead ends: 1694 [2019-12-27 20:55:17,053 INFO L226 Difference]: Without dead ends: 1694 [2019-12-27 20:55:17,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:55:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2019-12-27 20:55:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 978. [2019-12-27 20:55:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-12-27 20:55:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2120 transitions. [2019-12-27 20:55:17,080 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2120 transitions. Word has length 53 [2019-12-27 20:55:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:17,080 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 2120 transitions. [2019-12-27 20:55:17,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2120 transitions. [2019-12-27 20:55:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:17,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:17,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:17,083 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1974989424, now seen corresponding path program 3 times [2019-12-27 20:55:17,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:17,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713616590] [2019-12-27 20:55:17,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:17,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713616590] [2019-12-27 20:55:17,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:17,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:17,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411242315] [2019-12-27 20:55:17,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:17,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:17,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 109 transitions. [2019-12-27 20:55:17,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:17,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:17,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:17,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:17,214 INFO L87 Difference]: Start difference. First operand 978 states and 2120 transitions. Second operand 3 states. [2019-12-27 20:55:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:17,331 INFO L93 Difference]: Finished difference Result 1313 states and 2802 transitions. [2019-12-27 20:55:17,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:17,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 20:55:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:17,334 INFO L225 Difference]: With dead ends: 1313 [2019-12-27 20:55:17,334 INFO L226 Difference]: Without dead ends: 1313 [2019-12-27 20:55:17,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-12-27 20:55:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 946. [2019-12-27 20:55:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-27 20:55:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2044 transitions. [2019-12-27 20:55:17,353 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2044 transitions. Word has length 53 [2019-12-27 20:55:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:17,354 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2044 transitions. [2019-12-27 20:55:17,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2044 transitions. [2019-12-27 20:55:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:17,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:17,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:17,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash 444800354, now seen corresponding path program 4 times [2019-12-27 20:55:17,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:17,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137302952] [2019-12-27 20:55:17,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:17,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137302952] [2019-12-27 20:55:17,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:17,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:17,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678584631] [2019-12-27 20:55:17,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:17,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:17,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 125 transitions. [2019-12-27 20:55:17,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:17,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:55:17,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:17,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:17,899 INFO L87 Difference]: Start difference. First operand 946 states and 2044 transitions. Second operand 6 states. [2019-12-27 20:55:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:18,155 INFO L93 Difference]: Finished difference Result 1297 states and 2765 transitions. [2019-12-27 20:55:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:18,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 20:55:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:18,160 INFO L225 Difference]: With dead ends: 1297 [2019-12-27 20:55:18,160 INFO L226 Difference]: Without dead ends: 1297 [2019-12-27 20:55:18,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-27 20:55:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 877. [2019-12-27 20:55:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-27 20:55:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1869 transitions. [2019-12-27 20:55:18,184 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1869 transitions. Word has length 53 [2019-12-27 20:55:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:18,184 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1869 transitions. [2019-12-27 20:55:18,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1869 transitions. [2019-12-27 20:55:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:18,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:18,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:18,187 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 20:55:18,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:18,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052819736] [2019-12-27 20:55:18,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:18,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:55:18,307 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:55:18,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff1_thd2~0_49) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t837~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t837~0.base_25|) |v_ULTIMATE.start_main_~#t837~0.offset_19| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_25| 1)) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_19|) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_25|) 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= 0 |v_#NULL.base_2|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t837~0.base_25| 4) |v_#length_19|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t837~0.base_25|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_21|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:55:18,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0_used~0_Out-2062081288 1) (= (mod ~a$w_buff1_used~0_Out-2062081288 256) 0) (= P0Thread1of1ForFork0_~arg.offset_Out-2062081288 |P0Thread1of1ForFork0_#in~arg.offset_In-2062081288|) (= ~a$w_buff1_used~0_Out-2062081288 ~a$w_buff0_used~0_In-2062081288) (= 1 ~a$w_buff0~0_Out-2062081288) (= P0Thread1of1ForFork0_~arg.base_Out-2062081288 |P0Thread1of1ForFork0_#in~arg.base_In-2062081288|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2062081288| 1) (= ~a$w_buff1~0_Out-2062081288 ~a$w_buff0~0_In-2062081288) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2062081288| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2062081288)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2062081288|, ~a$w_buff0~0=~a$w_buff0~0_In-2062081288, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2062081288|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2062081288} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2062081288|, ~a$w_buff1~0=~a$w_buff1~0_Out-2062081288, ~a$w_buff0~0=~a$w_buff0~0_Out-2062081288, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2062081288, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2062081288|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-2062081288, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-2062081288, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2062081288, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2062081288|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2062081288} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:55:18,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-27 20:55:18,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1457264124 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1457264124| ~a$w_buff1_used~0_In1457264124) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1457264124| |P1Thread1of1ForFork1_#t~ite23_Out1457264124|)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1457264124 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd2~0_In1457264124 256) 0)) (= (mod ~a$w_buff0_used~0_In1457264124 256) 0) (and (= (mod ~a$w_buff1_used~0_In1457264124 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite23_Out1457264124| ~a$w_buff1_used~0_In1457264124) (= |P1Thread1of1ForFork1_#t~ite23_Out1457264124| |P1Thread1of1ForFork1_#t~ite24_Out1457264124|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1457264124, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1457264124, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1457264124|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1457264124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1457264124, ~weak$$choice2~0=~weak$$choice2~0_In1457264124} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1457264124, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1457264124|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1457264124, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1457264124|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1457264124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1457264124, ~weak$$choice2~0=~weak$$choice2~0_In1457264124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 20:55:18,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:55:18,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In392227330 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In392227330 256) 0))) (or (and (= ~a$w_buff0_used~0_In392227330 |P0Thread1of1ForFork0_#t~ite5_Out392227330|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out392227330|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In392227330, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In392227330} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out392227330|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In392227330, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In392227330} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:55:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-853951212 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-853951212 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-853951212 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-853951212 256) 0))) (or (and (= ~a$w_buff1_used~0_In-853951212 |P0Thread1of1ForFork0_#t~ite6_Out-853951212|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-853951212| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-853951212, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-853951212, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-853951212, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-853951212} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-853951212|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-853951212, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-853951212, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-853951212, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-853951212} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:55:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-645062128 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-645062128 256) 0))) (or (and (= 0 ~a$r_buff0_thd1~0_Out-645062128) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-645062128 ~a$r_buff0_thd1~0_Out-645062128)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-645062128, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-645062128} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-645062128|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-645062128, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-645062128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:55:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1355405563 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1355405563 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1355405563 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1355405563 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1355405563|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1355405563| ~a$r_buff1_thd1~0_In-1355405563) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1355405563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1355405563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1355405563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1355405563} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1355405563, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1355405563|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1355405563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1355405563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1355405563} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:55:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:55:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:55:18,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In185331852 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In185331852 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out185331852| |P1Thread1of1ForFork1_#t~ite33_Out185331852|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out185331852| ~a$w_buff1~0_In185331852) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out185331852| ~a~0_In185331852) .cse2))) InVars {~a~0=~a~0_In185331852, ~a$w_buff1~0=~a$w_buff1~0_In185331852, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In185331852, ~a$w_buff1_used~0=~a$w_buff1_used~0_In185331852} OutVars{~a~0=~a~0_In185331852, ~a$w_buff1~0=~a$w_buff1~0_In185331852, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In185331852, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out185331852|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out185331852|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In185331852} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:55:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1697805693 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1697805693 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1697805693| ~a$w_buff0_used~0_In1697805693) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1697805693| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1697805693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1697805693} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1697805693|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1697805693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1697805693} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:55:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In2074227717 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In2074227717 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2074227717 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In2074227717 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out2074227717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In2074227717 |P1Thread1of1ForFork1_#t~ite35_Out2074227717|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2074227717, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2074227717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2074227717, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2074227717} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2074227717, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2074227717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2074227717, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2074227717|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2074227717} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:55:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In784830953 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In784830953 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out784830953|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In784830953 |P1Thread1of1ForFork1_#t~ite36_Out784830953|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In784830953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In784830953} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In784830953, ~a$w_buff0_used~0=~a$w_buff0_used~0_In784830953, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out784830953|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:55:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1829205779 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1829205779 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1829205779 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1829205779 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1829205779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd2~0_In1829205779 |P1Thread1of1ForFork1_#t~ite37_Out1829205779|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1829205779, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1829205779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1829205779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1829205779} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1829205779, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1829205779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1829205779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1829205779, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1829205779|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:55:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:55:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:55:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1075669067 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1075669067 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1075669067| ~a~0_In1075669067)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1075669067| ~a$w_buff1~0_In1075669067) (not .cse0)))) InVars {~a~0=~a~0_In1075669067, ~a$w_buff1~0=~a$w_buff1~0_In1075669067, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075669067, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075669067} OutVars{~a~0=~a~0_In1075669067, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1075669067|, ~a$w_buff1~0=~a$w_buff1~0_In1075669067, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075669067, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075669067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:55:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:55:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-266567564 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-266567564 256)))) (or (and (= ~a$w_buff0_used~0_In-266567564 |ULTIMATE.start_main_#t~ite42_Out-266567564|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-266567564|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-266567564, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-266567564} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-266567564, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-266567564, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-266567564|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:55:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In2128633920 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In2128633920 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2128633920 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2128633920 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2128633920| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out2128633920| ~a$w_buff1_used~0_In2128633920) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2128633920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2128633920, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2128633920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2128633920} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2128633920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2128633920, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2128633920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2128633920, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2128633920|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:55:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-15409322 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-15409322 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-15409322| ~a$r_buff0_thd0~0_In-15409322) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-15409322|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-15409322, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-15409322} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-15409322, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-15409322, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-15409322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:55:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1894080958 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1894080958 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1894080958 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1894080958 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1894080958| ~a$r_buff1_thd0~0_In-1894080958) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1894080958|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1894080958, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1894080958, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1894080958, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1894080958} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1894080958, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1894080958, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1894080958, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1894080958, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1894080958|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:55:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:55:18,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:55:18 BasicIcfg [2019-12-27 20:55:18,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:55:18,427 INFO L168 Benchmark]: Toolchain (without parser) took 20806.27 ms. Allocated memory was 143.7 MB in the beginning and 719.8 MB in the end (delta: 576.2 MB). Free memory was 99.9 MB in the beginning and 553.0 MB in the end (delta: -453.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,431 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:55:18,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.32 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,432 INFO L168 Benchmark]: Boogie Preprocessor took 35.52 ms. Allocated memory is still 200.8 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,433 INFO L168 Benchmark]: RCFGBuilder took 750.72 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.1 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,433 INFO L168 Benchmark]: TraceAbstraction took 19104.26 ms. Allocated memory was 200.8 MB in the beginning and 719.8 MB in the end (delta: 519.0 MB). Free memory was 104.1 MB in the beginning and 553.0 MB in the end (delta: -448.9 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:18,441 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.32 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.52 ms. Allocated memory is still 200.8 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.72 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 105.1 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19104.26 ms. Allocated memory was 200.8 MB in the beginning and 719.8 MB in the end (delta: 519.0 MB). Free memory was 104.1 MB in the beginning and 553.0 MB in the end (delta: -448.9 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2232 SDtfs, 3184 SDslu, 4335 SDs, 0 SdLazy, 3584 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 6422 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 99540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...