/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/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:18:14,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:18:14,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:18:14,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:18:14,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:18:14,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:18:14,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:18:14,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:18:14,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:18:14,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:18:14,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:18:14,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:18:14,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:18:14,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:18:14,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:18:14,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:18:14,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:18:14,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:18:14,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:18:14,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:18:14,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:18:14,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:18:14,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:18:14,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:18:14,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:18:14,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:18:14,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:18:14,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:18:14,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:18:14,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:18:14,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:18:14,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:18:14,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:18:14,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:18:14,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:18:14,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:18:14,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:18:14,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:18:14,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:18:14,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:18:14,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:18:14,397 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:18:14,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:18:14,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:18:14,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:18:14,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:18:14,418 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:18:14,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:18:14,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:18:14,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:18:14,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:18:14,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:18:14,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:18:14,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:18:14,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:18:14,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:18:14,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:18:14,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:18:14,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:18:14,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:18:14,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:18:14,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:18:14,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:18:14,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:18:14,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:18:14,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:18:14,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:18:14,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:18:14,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:18:14,424 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:18:14,424 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:18:14,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:18:14,426 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:18:14,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:18:14,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:18:14,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:18:14,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:18:14,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:18:14,730 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:18:14,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-27 20:18:14,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ea1ce1/855edafa884e49db852448439fa1f79d/FLAGf4b364776 [2019-12-27 20:18:15,399 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:18:15,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-27 20:18:15,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ea1ce1/855edafa884e49db852448439fa1f79d/FLAGf4b364776 [2019-12-27 20:18:15,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ea1ce1/855edafa884e49db852448439fa1f79d [2019-12-27 20:18:15,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:18:15,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:18:15,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:18:15,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:18:15,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:18:15,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:18:15" (1/1) ... [2019-12-27 20:18:15,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117117bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:15, skipping insertion in model container [2019-12-27 20:18:15,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:18:15" (1/1) ... [2019-12-27 20:18:15,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:18:15,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:18:16,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:18:16,412 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:18:16,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:18:16,561 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:18:16,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16 WrapperNode [2019-12-27 20:18:16,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:18:16,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:18:16,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:18:16,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:18:16,572 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:18:16" (1/1) ... [2019-12-27 20:18:16,595 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:18:16" (1/1) ... [2019-12-27 20:18:16,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:18:16,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:18:16,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:18:16,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:18:16,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (1/1) ... [2019-12-27 20:18:16,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:18:16,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:18:16,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:18:16,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:18:16,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (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:18:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:18:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:18:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:18:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:18:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:18:16,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:18:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:18:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:18:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:18:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:18:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:18:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:18:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:18:16,750 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:18:17,584 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:18:17,585 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:18:17,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:18:17 BoogieIcfgContainer [2019-12-27 20:18:17,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:18:17,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:18:17,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:18:17,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:18:17,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:18:15" (1/3) ... [2019-12-27 20:18:17,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7994d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:18:17, skipping insertion in model container [2019-12-27 20:18:17,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:18:16" (2/3) ... [2019-12-27 20:18:17,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7994d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:18:17, skipping insertion in model container [2019-12-27 20:18:17,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:18:17" (3/3) ... [2019-12-27 20:18:17,596 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2019-12-27 20:18:17,607 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:18:17,607 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:18:17,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:18:17,617 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:18:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,735 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,748 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:18:17,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:18:17,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:18:17,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:18:17,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:18:17,793 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:18:17,793 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:18:17,793 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:18:17,793 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:18:17,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:18:17,812 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 20:18:17,814 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:18:17,931 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:18:17,931 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:18:17,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:18:17,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:18:18,036 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:18:18,036 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:18:18,044 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:18:18,065 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:18:18,067 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:18:21,657 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:18:21,782 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:18:21,806 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 20:18:21,807 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 20:18:21,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 20:18:42,102 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 20:18:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 20:18:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:18:42,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:18:42,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:18:42,111 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:18:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:18:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 20:18:42,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:18:42,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705249026] [2019-12-27 20:18:42,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:18:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:18:42,368 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:18:42,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705249026] [2019-12-27 20:18:42,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:18:42,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:18:42,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584626440] [2019-12-27 20:18:42,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:18:42,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:18:42,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:18:42,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:18:42,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:18:42,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:18:42,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:18:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:18:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:18:42,415 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 20:18:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:18:46,037 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 20:18:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:18:46,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:18:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:18:46,686 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 20:18:46,687 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 20:18:46,688 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:18:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 20:18:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 20:18:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 20:18:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 20:18:59,910 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 20:18:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:18:59,910 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 20:18:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:18:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 20:18:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:18:59,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:18:59,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:18:59,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:18:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:18:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 20:18:59,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:18:59,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322500900] [2019-12-27 20:18:59,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:18:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:00,045 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:19:00,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322500900] [2019-12-27 20:19:00,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:00,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:19:00,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889669494] [2019-12-27 20:19:00,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:00,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:00,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:19:00,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:00,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:00,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:19:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:19:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:19:00,055 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 20:19:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:05,984 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 20:19:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:19:05,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:19:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:06,685 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 20:19:06,685 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 20:19:06,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:19:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 20:19:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 20:19:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 20:19:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 20:19:16,508 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 20:19:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:16,508 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 20:19:16,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:19:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 20:19:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:19:16,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:16,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:19:16,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 20:19:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:16,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996955384] [2019-12-27 20:19:16,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:16,575 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:19:16,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996955384] [2019-12-27 20:19:16,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:16,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:19:16,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316334993] [2019-12-27 20:19:16,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:16,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:16,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:19:16,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:16,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:16,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:19:16,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:19:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:19:16,581 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 20:19:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:16,724 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 20:19:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:19:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:19:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:16,780 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 20:19:16,780 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 20:19:16,781 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:19:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 20:19:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 20:19:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 20:19:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 20:19:17,460 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 20:19:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:17,461 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 20:19:17,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:19:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 20:19:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:19:17,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:17,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:19:17,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 20:19:17,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:17,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126261009] [2019-12-27 20:19:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:18,043 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:19:18,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126261009] [2019-12-27 20:19:18,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:18,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:19:18,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904869916] [2019-12-27 20:19:18,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:18,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:18,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:19:18,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:18,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:18,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:19:18,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:19:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:19:18,050 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 20:19:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:18,296 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 20:19:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:19:18,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:19:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:18,389 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 20:19:18,390 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 20:19:18,390 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:19:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 20:19:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 20:19:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 20:19:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 20:19:19,199 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 20:19:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 20:19:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:19:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 20:19:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:19:19,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:19,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:19:19,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 20:19:19,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:19,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617505058] [2019-12-27 20:19:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:19,300 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:19:19,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617505058] [2019-12-27 20:19:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:19:19,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994511471] [2019-12-27 20:19:19,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:19,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:19,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:19:19,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:19,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:19,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:19:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:19:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:19:19,308 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 20:19:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:19,723 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 20:19:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:19:19,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:19:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:19,803 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 20:19:19,803 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 20:19:19,803 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:19:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 20:19:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 20:19:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 20:19:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 20:19:21,006 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 20:19:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:21,007 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 20:19:21,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:19:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 20:19:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:19:21,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:21,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:19:21,011 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 20:19:21,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:21,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246171382] [2019-12-27 20:19:21,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:21,109 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:19:21,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246171382] [2019-12-27 20:19:21,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:21,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:19:21,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873125240] [2019-12-27 20:19:21,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:21,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:21,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:19:21,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:21,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:19:21,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:19:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:19:21,116 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 20:19:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:21,503 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 20:19:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:19:21,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:19:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:21,592 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 20:19:21,593 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 20:19:21,593 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:19:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 20:19:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 20:19:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 20:19:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 20:19:22,950 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 20:19:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:22,950 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 20:19:22,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:19:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 20:19:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:19:22,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:22,960 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] [2019-12-27 20:19:22,961 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 20:19:22,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:22,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823859040] [2019-12-27 20:19:22,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:23,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:19:23,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823859040] [2019-12-27 20:19:23,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:23,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:19:23,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686591542] [2019-12-27 20:19:23,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:23,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:23,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 20:19:23,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:23,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:19:23,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:19:23,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:23,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:19:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:19:23,208 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 7 states. [2019-12-27 20:19:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:24,524 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-27 20:19:24,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:19:24,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:19:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:24,632 INFO L225 Difference]: With dead ends: 63407 [2019-12-27 20:19:24,632 INFO L226 Difference]: Without dead ends: 63400 [2019-12-27 20:19:24,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:19:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-27 20:19:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-27 20:19:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-27 20:19:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-27 20:19:26,102 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-27 20:19:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:26,102 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-27 20:19:26,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:19:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-27 20:19:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:19:26,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:26,112 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] [2019-12-27 20:19:26,112 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 20:19:26,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:26,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899073730] [2019-12-27 20:19:26,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:26,201 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:19:26,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899073730] [2019-12-27 20:19:26,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:26,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:19:26,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746846068] [2019-12-27 20:19:26,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:26,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:26,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 60 transitions. [2019-12-27 20:19:26,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:26,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:19:26,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:19:26,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:19:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:26,215 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 5 states. [2019-12-27 20:19:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:26,998 INFO L93 Difference]: Finished difference Result 66059 states and 208933 transitions. [2019-12-27 20:19:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:19:26,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:19:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:27,128 INFO L225 Difference]: With dead ends: 66059 [2019-12-27 20:19:27,128 INFO L226 Difference]: Without dead ends: 66052 [2019-12-27 20:19:27,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:19:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66052 states. [2019-12-27 20:19:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66052 to 46168. [2019-12-27 20:19:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46168 states. [2019-12-27 20:19:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46168 states to 46168 states and 149707 transitions. [2019-12-27 20:19:28,072 INFO L78 Accepts]: Start accepts. Automaton has 46168 states and 149707 transitions. Word has length 22 [2019-12-27 20:19:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:28,072 INFO L462 AbstractCegarLoop]: Abstraction has 46168 states and 149707 transitions. [2019-12-27 20:19:28,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:19:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 46168 states and 149707 transitions. [2019-12-27 20:19:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:19:28,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:28,084 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:19:28,084 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 20:19:28,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:28,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8686531] [2019-12-27 20:19:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:28,125 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:19:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8686531] [2019-12-27 20:19:28,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:28,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:19:28,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370038434] [2019-12-27 20:19:28,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:28,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:28,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:19:28,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:28,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:19:28,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:19:28,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:19:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:28,594 INFO L87 Difference]: Start difference. First operand 46168 states and 149707 transitions. Second operand 5 states. [2019-12-27 20:19:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:28,719 INFO L93 Difference]: Finished difference Result 17945 states and 54933 transitions. [2019-12-27 20:19:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:19:28,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:19:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:28,756 INFO L225 Difference]: With dead ends: 17945 [2019-12-27 20:19:28,756 INFO L226 Difference]: Without dead ends: 17945 [2019-12-27 20:19:28,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17945 states. [2019-12-27 20:19:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17945 to 17582. [2019-12-27 20:19:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17582 states. [2019-12-27 20:19:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17582 states to 17582 states and 53897 transitions. [2019-12-27 20:19:29,102 INFO L78 Accepts]: Start accepts. Automaton has 17582 states and 53897 transitions. Word has length 25 [2019-12-27 20:19:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:29,102 INFO L462 AbstractCegarLoop]: Abstraction has 17582 states and 53897 transitions. [2019-12-27 20:19:29,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:19:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17582 states and 53897 transitions. [2019-12-27 20:19:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:19:29,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:29,114 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:19:29,114 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-27 20:19:29,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:29,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775566787] [2019-12-27 20:19:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:29,315 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:19:29,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775566787] [2019-12-27 20:19:29,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:29,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:19:29,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814293056] [2019-12-27 20:19:29,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:29,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:29,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 78 transitions. [2019-12-27 20:19:29,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:29,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:19:29,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:19:29,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:19:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:19:29,495 INFO L87 Difference]: Start difference. First operand 17582 states and 53897 transitions. Second operand 10 states. [2019-12-27 20:19:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:32,029 INFO L93 Difference]: Finished difference Result 42822 states and 129108 transitions. [2019-12-27 20:19:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:19:32,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 20:19:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:32,095 INFO L225 Difference]: With dead ends: 42822 [2019-12-27 20:19:32,096 INFO L226 Difference]: Without dead ends: 42822 [2019-12-27 20:19:32,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:19:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42822 states. [2019-12-27 20:19:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42822 to 17618. [2019-12-27 20:19:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17618 states. [2019-12-27 20:19:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17618 states to 17618 states and 54131 transitions. [2019-12-27 20:19:32,521 INFO L78 Accepts]: Start accepts. Automaton has 17618 states and 54131 transitions. Word has length 26 [2019-12-27 20:19:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:32,521 INFO L462 AbstractCegarLoop]: Abstraction has 17618 states and 54131 transitions. [2019-12-27 20:19:32,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:19:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17618 states and 54131 transitions. [2019-12-27 20:19:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:19:32,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:32,535 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] [2019-12-27 20:19:32,535 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:32,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 20:19:32,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:32,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150766668] [2019-12-27 20:19:32,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:32,637 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:19:32,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150766668] [2019-12-27 20:19:32,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:32,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:19:32,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267306887] [2019-12-27 20:19:32,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:32,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:32,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:19:32,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:32,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:32,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:19:32,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:32,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:19:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:32,650 INFO L87 Difference]: Start difference. First operand 17618 states and 54131 transitions. Second operand 5 states. [2019-12-27 20:19:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:33,009 INFO L93 Difference]: Finished difference Result 22269 states and 67269 transitions. [2019-12-27 20:19:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:19:33,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:19:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:33,041 INFO L225 Difference]: With dead ends: 22269 [2019-12-27 20:19:33,042 INFO L226 Difference]: Without dead ends: 22269 [2019-12-27 20:19:33,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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:19:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22269 states. [2019-12-27 20:19:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22269 to 20881. [2019-12-27 20:19:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20881 states. [2019-12-27 20:19:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20881 states to 20881 states and 63779 transitions. [2019-12-27 20:19:33,681 INFO L78 Accepts]: Start accepts. Automaton has 20881 states and 63779 transitions. Word has length 27 [2019-12-27 20:19:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:33,681 INFO L462 AbstractCegarLoop]: Abstraction has 20881 states and 63779 transitions. [2019-12-27 20:19:33,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:19:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20881 states and 63779 transitions. [2019-12-27 20:19:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:19:33,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:33,697 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] [2019-12-27 20:19:33,697 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 20:19:33,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:33,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203700455] [2019-12-27 20:19:33,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:33,780 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:19:33,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203700455] [2019-12-27 20:19:33,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:33,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:19:33,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729364015] [2019-12-27 20:19:33,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:33,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:33,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:19:33,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:33,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:33,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:19:33,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:19:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:33,795 INFO L87 Difference]: Start difference. First operand 20881 states and 63779 transitions. Second operand 5 states. [2019-12-27 20:19:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:33,947 INFO L93 Difference]: Finished difference Result 21383 states and 65114 transitions. [2019-12-27 20:19:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:19:33,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:19:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:33,976 INFO L225 Difference]: With dead ends: 21383 [2019-12-27 20:19:33,977 INFO L226 Difference]: Without dead ends: 21383 [2019-12-27 20:19:33,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-12-27 20:19:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 21383. [2019-12-27 20:19:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21383 states. [2019-12-27 20:19:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21383 states to 21383 states and 65114 transitions. [2019-12-27 20:19:34,282 INFO L78 Accepts]: Start accepts. Automaton has 21383 states and 65114 transitions. Word has length 28 [2019-12-27 20:19:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:34,282 INFO L462 AbstractCegarLoop]: Abstraction has 21383 states and 65114 transitions. [2019-12-27 20:19:34,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:19:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21383 states and 65114 transitions. [2019-12-27 20:19:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:19:34,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:34,299 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] [2019-12-27 20:19:34,299 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 20:19:34,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:34,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067230768] [2019-12-27 20:19:34,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:34,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:19:34,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067230768] [2019-12-27 20:19:34,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:34,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:19:34,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582244314] [2019-12-27 20:19:34,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:34,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:34,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 20:19:34,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:34,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:34,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:19:34,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:19:34,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:19:34,419 INFO L87 Difference]: Start difference. First operand 21383 states and 65114 transitions. Second operand 5 states. [2019-12-27 20:19:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:34,882 INFO L93 Difference]: Finished difference Result 24683 states and 74027 transitions. [2019-12-27 20:19:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:19:34,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:19:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:34,931 INFO L225 Difference]: With dead ends: 24683 [2019-12-27 20:19:34,931 INFO L226 Difference]: Without dead ends: 24683 [2019-12-27 20:19:34,931 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:19:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24683 states. [2019-12-27 20:19:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24683 to 20707. [2019-12-27 20:19:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20707 states. [2019-12-27 20:19:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20707 states to 20707 states and 63185 transitions. [2019-12-27 20:19:35,303 INFO L78 Accepts]: Start accepts. Automaton has 20707 states and 63185 transitions. Word has length 29 [2019-12-27 20:19:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:35,304 INFO L462 AbstractCegarLoop]: Abstraction has 20707 states and 63185 transitions. [2019-12-27 20:19:35,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:19:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 20707 states and 63185 transitions. [2019-12-27 20:19:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:19:35,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:35,325 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] [2019-12-27 20:19:35,325 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 20:19:35,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:35,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316028408] [2019-12-27 20:19:35,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:35,521 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:19:35,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316028408] [2019-12-27 20:19:35,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:35,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:19:35,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841731885] [2019-12-27 20:19:35,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:35,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:35,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 20:19:35,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:35,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:19:35,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:19:35,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:19:35,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:19:35,558 INFO L87 Difference]: Start difference. First operand 20707 states and 63185 transitions. Second operand 8 states. [2019-12-27 20:19:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:36,727 INFO L93 Difference]: Finished difference Result 31266 states and 93143 transitions. [2019-12-27 20:19:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:19:36,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 20:19:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:36,771 INFO L225 Difference]: With dead ends: 31266 [2019-12-27 20:19:36,771 INFO L226 Difference]: Without dead ends: 31266 [2019-12-27 20:19:36,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:19:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31266 states. [2019-12-27 20:19:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31266 to 23041. [2019-12-27 20:19:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23041 states. [2019-12-27 20:19:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 70098 transitions. [2019-12-27 20:19:37,525 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 70098 transitions. Word has length 33 [2019-12-27 20:19:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:37,525 INFO L462 AbstractCegarLoop]: Abstraction has 23041 states and 70098 transitions. [2019-12-27 20:19:37,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:19:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 70098 transitions. [2019-12-27 20:19:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:19:37,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:37,548 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] [2019-12-27 20:19:37,548 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 20:19:37,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:37,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204727803] [2019-12-27 20:19:37,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:37,727 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:19:37,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204727803] [2019-12-27 20:19:37,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:37,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:19:37,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830485567] [2019-12-27 20:19:37,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:37,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:37,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 83 transitions. [2019-12-27 20:19:37,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:37,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:19:37,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:19:37,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:19:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:19:37,760 INFO L87 Difference]: Start difference. First operand 23041 states and 70098 transitions. Second operand 8 states. [2019-12-27 20:19:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:39,084 INFO L93 Difference]: Finished difference Result 32724 states and 97602 transitions. [2019-12-27 20:19:39,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:19:39,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 20:19:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:39,133 INFO L225 Difference]: With dead ends: 32724 [2019-12-27 20:19:39,133 INFO L226 Difference]: Without dead ends: 32724 [2019-12-27 20:19:39,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:19:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32724 states. [2019-12-27 20:19:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32724 to 21920. [2019-12-27 20:19:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21920 states. [2019-12-27 20:19:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21920 states to 21920 states and 66861 transitions. [2019-12-27 20:19:39,531 INFO L78 Accepts]: Start accepts. Automaton has 21920 states and 66861 transitions. Word has length 35 [2019-12-27 20:19:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:39,531 INFO L462 AbstractCegarLoop]: Abstraction has 21920 states and 66861 transitions. [2019-12-27 20:19:39,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:19:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21920 states and 66861 transitions. [2019-12-27 20:19:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:19:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:39,559 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] [2019-12-27 20:19:39,559 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1061116233, now seen corresponding path program 1 times [2019-12-27 20:19:39,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:39,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601036153] [2019-12-27 20:19:39,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:39,831 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:19:39,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601036153] [2019-12-27 20:19:39,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:39,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:19:39,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [345524921] [2019-12-27 20:19:39,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:39,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:39,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 127 transitions. [2019-12-27 20:19:39,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:39,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:19:40,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:19:40,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:19:40,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:19:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:19:40,066 INFO L87 Difference]: Start difference. First operand 21920 states and 66861 transitions. Second operand 14 states. [2019-12-27 20:19:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:44,419 INFO L93 Difference]: Finished difference Result 47002 states and 138403 transitions. [2019-12-27 20:19:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 20:19:44,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-12-27 20:19:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:44,512 INFO L225 Difference]: With dead ends: 47002 [2019-12-27 20:19:44,512 INFO L226 Difference]: Without dead ends: 47002 [2019-12-27 20:19:44,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=420, Invalid=1302, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:19:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47002 states. [2019-12-27 20:19:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47002 to 23414. [2019-12-27 20:19:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23414 states. [2019-12-27 20:19:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23414 states to 23414 states and 71091 transitions. [2019-12-27 20:19:45,017 INFO L78 Accepts]: Start accepts. Automaton has 23414 states and 71091 transitions. Word has length 37 [2019-12-27 20:19:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:45,017 INFO L462 AbstractCegarLoop]: Abstraction has 23414 states and 71091 transitions. [2019-12-27 20:19:45,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:19:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 23414 states and 71091 transitions. [2019-12-27 20:19:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:19:45,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:45,043 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] [2019-12-27 20:19:45,043 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1548882337, now seen corresponding path program 2 times [2019-12-27 20:19:45,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:45,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080620282] [2019-12-27 20:19:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:45,255 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:19:45,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080620282] [2019-12-27 20:19:45,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:45,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:19:45,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447777918] [2019-12-27 20:19:45,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:45,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:45,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 123 transitions. [2019-12-27 20:19:45,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:45,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:19:45,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:19:45,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:19:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:19:45,419 INFO L87 Difference]: Start difference. First operand 23414 states and 71091 transitions. Second operand 12 states. [2019-12-27 20:19:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:48,244 INFO L93 Difference]: Finished difference Result 66516 states and 194704 transitions. [2019-12-27 20:19:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:19:48,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-27 20:19:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:48,345 INFO L225 Difference]: With dead ends: 66516 [2019-12-27 20:19:48,345 INFO L226 Difference]: Without dead ends: 66516 [2019-12-27 20:19:48,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:19:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66516 states. [2019-12-27 20:19:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66516 to 23040. [2019-12-27 20:19:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23040 states. [2019-12-27 20:19:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23040 states to 23040 states and 69877 transitions. [2019-12-27 20:19:49,439 INFO L78 Accepts]: Start accepts. Automaton has 23040 states and 69877 transitions. Word has length 37 [2019-12-27 20:19:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:49,439 INFO L462 AbstractCegarLoop]: Abstraction has 23040 states and 69877 transitions. [2019-12-27 20:19:49,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:19:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23040 states and 69877 transitions. [2019-12-27 20:19:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:19:49,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:49,462 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] [2019-12-27 20:19:49,463 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 20:19:49,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:49,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353542675] [2019-12-27 20:19:49,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:49,517 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:19:49,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353542675] [2019-12-27 20:19:49,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:49,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:19:49,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343139780] [2019-12-27 20:19:49,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:49,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:49,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 20:19:49,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:49,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:19:49,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:19:49,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:19:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:19:49,603 INFO L87 Difference]: Start difference. First operand 23040 states and 69877 transitions. Second operand 3 states. [2019-12-27 20:19:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:49,726 INFO L93 Difference]: Finished difference Result 23039 states and 69875 transitions. [2019-12-27 20:19:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:19:49,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:19:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:49,776 INFO L225 Difference]: With dead ends: 23039 [2019-12-27 20:19:49,776 INFO L226 Difference]: Without dead ends: 23039 [2019-12-27 20:19:49,777 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:19:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23039 states. [2019-12-27 20:19:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23039 to 23039. [2019-12-27 20:19:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23039 states. [2019-12-27 20:19:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23039 states to 23039 states and 69875 transitions. [2019-12-27 20:19:50,455 INFO L78 Accepts]: Start accepts. Automaton has 23039 states and 69875 transitions. Word has length 39 [2019-12-27 20:19:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:19:50,455 INFO L462 AbstractCegarLoop]: Abstraction has 23039 states and 69875 transitions. [2019-12-27 20:19:50,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:19:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23039 states and 69875 transitions. [2019-12-27 20:19:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:19:50,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:19:50,499 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] [2019-12-27 20:19:50,499 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:19:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:19:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 252616620, now seen corresponding path program 1 times [2019-12-27 20:19:50,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:19:50,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110067367] [2019-12-27 20:19:50,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:19:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:19:50,856 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:19:50,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110067367] [2019-12-27 20:19:50,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:19:50,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:19:50,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369510691] [2019-12-27 20:19:50,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:19:50,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:19:50,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 135 transitions. [2019-12-27 20:19:50,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:19:50,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:19:51,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:19:51,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:19:51,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:19:51,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:19:51,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:19:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:19:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:19:51,307 INFO L87 Difference]: Start difference. First operand 23039 states and 69875 transitions. Second operand 18 states. [2019-12-27 20:19:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:19:59,686 INFO L93 Difference]: Finished difference Result 61221 states and 183575 transitions. [2019-12-27 20:19:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 20:19:59,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-12-27 20:19:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:19:59,785 INFO L225 Difference]: With dead ends: 61221 [2019-12-27 20:19:59,785 INFO L226 Difference]: Without dead ends: 61221 [2019-12-27 20:19:59,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=748, Invalid=2792, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:19:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61221 states. [2019-12-27 20:20:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61221 to 24236. [2019-12-27 20:20:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24236 states. [2019-12-27 20:20:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24236 states to 24236 states and 73576 transitions. [2019-12-27 20:20:00,400 INFO L78 Accepts]: Start accepts. Automaton has 24236 states and 73576 transitions. Word has length 39 [2019-12-27 20:20:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:00,401 INFO L462 AbstractCegarLoop]: Abstraction has 24236 states and 73576 transitions. [2019-12-27 20:20:00,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:20:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24236 states and 73576 transitions. [2019-12-27 20:20:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:20:00,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:00,426 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] [2019-12-27 20:20:00,426 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 157045846, now seen corresponding path program 2 times [2019-12-27 20:20:00,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:00,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284699335] [2019-12-27 20:20:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:00,629 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:20:00,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284699335] [2019-12-27 20:20:00,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:20:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999425437] [2019-12-27 20:20:00,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:00,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:00,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 117 transitions. [2019-12-27 20:20:00,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:00,821 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:20:00,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:20:00,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:20:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:20:00,823 INFO L87 Difference]: Start difference. First operand 24236 states and 73576 transitions. Second operand 11 states. [2019-12-27 20:20:03,013 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 17 [2019-12-27 20:20:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:03,945 INFO L93 Difference]: Finished difference Result 51578 states and 152794 transitions. [2019-12-27 20:20:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:20:03,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 20:20:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:04,023 INFO L225 Difference]: With dead ends: 51578 [2019-12-27 20:20:04,023 INFO L226 Difference]: Without dead ends: 51578 [2019-12-27 20:20:04,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:20:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51578 states. [2019-12-27 20:20:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51578 to 22170. [2019-12-27 20:20:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22170 states. [2019-12-27 20:20:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22170 states to 22170 states and 67617 transitions. [2019-12-27 20:20:04,572 INFO L78 Accepts]: Start accepts. Automaton has 22170 states and 67617 transitions. Word has length 39 [2019-12-27 20:20:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:04,572 INFO L462 AbstractCegarLoop]: Abstraction has 22170 states and 67617 transitions. [2019-12-27 20:20:04,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:20:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22170 states and 67617 transitions. [2019-12-27 20:20:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:20:04,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:04,597 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] [2019-12-27 20:20:04,598 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 20:20:04,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:04,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992974909] [2019-12-27 20:20:04,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:04,656 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:20:04,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992974909] [2019-12-27 20:20:04,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:04,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:20:04,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330629680] [2019-12-27 20:20:04,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:04,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:04,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 488 transitions. [2019-12-27 20:20:04,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:04,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:20:04,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:20:04,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:20:04,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:20:04,886 INFO L87 Difference]: Start difference. First operand 22170 states and 67617 transitions. Second operand 8 states. [2019-12-27 20:20:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:05,814 INFO L93 Difference]: Finished difference Result 31034 states and 93762 transitions. [2019-12-27 20:20:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:20:05,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:20:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:05,860 INFO L225 Difference]: With dead ends: 31034 [2019-12-27 20:20:05,860 INFO L226 Difference]: Without dead ends: 31034 [2019-12-27 20:20:05,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:20:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-12-27 20:20:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 28611. [2019-12-27 20:20:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28611 states. [2019-12-27 20:20:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28611 states to 28611 states and 87060 transitions. [2019-12-27 20:20:06,328 INFO L78 Accepts]: Start accepts. Automaton has 28611 states and 87060 transitions. Word has length 40 [2019-12-27 20:20:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:06,328 INFO L462 AbstractCegarLoop]: Abstraction has 28611 states and 87060 transitions. [2019-12-27 20:20:06,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:20:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28611 states and 87060 transitions. [2019-12-27 20:20:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:20:06,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:06,355 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] [2019-12-27 20:20:06,356 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 20:20:06,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:06,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450887768] [2019-12-27 20:20:06,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:06,443 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:20:06,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450887768] [2019-12-27 20:20:06,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:06,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:06,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850209665] [2019-12-27 20:20:06,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:06,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:06,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 20:20:06,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:06,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:20:06,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:20:06,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:20:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:20:06,563 INFO L87 Difference]: Start difference. First operand 28611 states and 87060 transitions. Second operand 4 states. [2019-12-27 20:20:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:06,908 INFO L93 Difference]: Finished difference Result 38411 states and 114551 transitions. [2019-12-27 20:20:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:20:06,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 20:20:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:07,399 INFO L225 Difference]: With dead ends: 38411 [2019-12-27 20:20:07,399 INFO L226 Difference]: Without dead ends: 38411 [2019-12-27 20:20:07,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:20:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2019-12-27 20:20:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 28423. [2019-12-27 20:20:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28423 states. [2019-12-27 20:20:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28423 states to 28423 states and 85663 transitions. [2019-12-27 20:20:07,884 INFO L78 Accepts]: Start accepts. Automaton has 28423 states and 85663 transitions. Word has length 40 [2019-12-27 20:20:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:07,884 INFO L462 AbstractCegarLoop]: Abstraction has 28423 states and 85663 transitions. [2019-12-27 20:20:07,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:20:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 28423 states and 85663 transitions. [2019-12-27 20:20:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:20:07,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:07,915 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] [2019-12-27 20:20:07,915 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-27 20:20:07,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:07,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374558486] [2019-12-27 20:20:07,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:07,956 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:20:07,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374558486] [2019-12-27 20:20:07,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:07,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:20:07,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062540634] [2019-12-27 20:20:07,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:07,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:08,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 356 transitions. [2019-12-27 20:20:08,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:08,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:20:08,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:20:08,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:20:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:20:08,070 INFO L87 Difference]: Start difference. First operand 28423 states and 85663 transitions. Second operand 6 states. [2019-12-27 20:20:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:08,222 INFO L93 Difference]: Finished difference Result 26914 states and 82145 transitions. [2019-12-27 20:20:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:20:08,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:20:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:08,273 INFO L225 Difference]: With dead ends: 26914 [2019-12-27 20:20:08,273 INFO L226 Difference]: Without dead ends: 26914 [2019-12-27 20:20:08,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:20:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2019-12-27 20:20:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 24881. [2019-12-27 20:20:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24881 states. [2019-12-27 20:20:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24881 states to 24881 states and 76507 transitions. [2019-12-27 20:20:08,744 INFO L78 Accepts]: Start accepts. Automaton has 24881 states and 76507 transitions. Word has length 41 [2019-12-27 20:20:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:08,744 INFO L462 AbstractCegarLoop]: Abstraction has 24881 states and 76507 transitions. [2019-12-27 20:20:08,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:20:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24881 states and 76507 transitions. [2019-12-27 20:20:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:20:08,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:08,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:08,771 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-27 20:20:08,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:08,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516977723] [2019-12-27 20:20:08,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:08,846 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:20:08,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516977723] [2019-12-27 20:20:08,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:08,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:20:08,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506801265] [2019-12-27 20:20:08,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:08,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:09,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 624 transitions. [2019-12-27 20:20:09,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:09,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:20:09,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:20:09,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:09,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:20:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:20:09,189 INFO L87 Difference]: Start difference. First operand 24881 states and 76507 transitions. Second operand 9 states. [2019-12-27 20:20:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:10,855 INFO L93 Difference]: Finished difference Result 32065 states and 97430 transitions. [2019-12-27 20:20:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:20:10,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:20:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:10,898 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 20:20:10,899 INFO L226 Difference]: Without dead ends: 32065 [2019-12-27 20:20:10,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:20:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32065 states. [2019-12-27 20:20:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32065 to 25864. [2019-12-27 20:20:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25864 states. [2019-12-27 20:20:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25864 states to 25864 states and 79468 transitions. [2019-12-27 20:20:11,317 INFO L78 Accepts]: Start accepts. Automaton has 25864 states and 79468 transitions. Word has length 65 [2019-12-27 20:20:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:11,317 INFO L462 AbstractCegarLoop]: Abstraction has 25864 states and 79468 transitions. [2019-12-27 20:20:11,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:20:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25864 states and 79468 transitions. [2019-12-27 20:20:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:20:11,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:11,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:11,343 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash -589431029, now seen corresponding path program 2 times [2019-12-27 20:20:11,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:11,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684685788] [2019-12-27 20:20:11,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:11,399 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:20:11,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684685788] [2019-12-27 20:20:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:11,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397930550] [2019-12-27 20:20:11,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:11,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:11,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 394 transitions. [2019-12-27 20:20:11,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:11,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:20:11,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:11,642 INFO L87 Difference]: Start difference. First operand 25864 states and 79468 transitions. Second operand 3 states. [2019-12-27 20:20:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:11,776 INFO L93 Difference]: Finished difference Result 32342 states and 98169 transitions. [2019-12-27 20:20:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:11,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:20:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:11,818 INFO L225 Difference]: With dead ends: 32342 [2019-12-27 20:20:11,818 INFO L226 Difference]: Without dead ends: 32342 [2019-12-27 20:20:11,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:20:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32342 states. [2019-12-27 20:20:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32342 to 26565. [2019-12-27 20:20:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26565 states. [2019-12-27 20:20:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26565 states to 26565 states and 81381 transitions. [2019-12-27 20:20:12,268 INFO L78 Accepts]: Start accepts. Automaton has 26565 states and 81381 transitions. Word has length 65 [2019-12-27 20:20:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:12,268 INFO L462 AbstractCegarLoop]: Abstraction has 26565 states and 81381 transitions. [2019-12-27 20:20:12,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26565 states and 81381 transitions. [2019-12-27 20:20:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:20:12,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:12,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:12,299 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-27 20:20:12,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:12,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182063527] [2019-12-27 20:20:12,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:12,809 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:20:12,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182063527] [2019-12-27 20:20:12,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:12,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:20:12,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276591031] [2019-12-27 20:20:12,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:12,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:13,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 627 transitions. [2019-12-27 20:20:13,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:20:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:20:14,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 20:20:14,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:20:14,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:14,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:20:14,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:20:14,024 INFO L87 Difference]: Start difference. First operand 26565 states and 81381 transitions. Second operand 20 states. [2019-12-27 20:20:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:23,045 INFO L93 Difference]: Finished difference Result 62517 states and 188116 transitions. [2019-12-27 20:20:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 20:20:23,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 20:20:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:23,119 INFO L225 Difference]: With dead ends: 62517 [2019-12-27 20:20:23,119 INFO L226 Difference]: Without dead ends: 46697 [2019-12-27 20:20:23,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 10 SyntacticMatches, 18 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1972 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=947, Invalid=6025, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 20:20:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46697 states. [2019-12-27 20:20:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46697 to 34692. [2019-12-27 20:20:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34692 states. [2019-12-27 20:20:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34692 states to 34692 states and 105548 transitions. [2019-12-27 20:20:24,059 INFO L78 Accepts]: Start accepts. Automaton has 34692 states and 105548 transitions. Word has length 66 [2019-12-27 20:20:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:24,060 INFO L462 AbstractCegarLoop]: Abstraction has 34692 states and 105548 transitions. [2019-12-27 20:20:24,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:20:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34692 states and 105548 transitions. [2019-12-27 20:20:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:20:24,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:24,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:24,098 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -649176865, now seen corresponding path program 2 times [2019-12-27 20:20:24,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:24,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96460481] [2019-12-27 20:20:24,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:24,367 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:20:24,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96460481] [2019-12-27 20:20:24,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:24,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:20:24,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58548269] [2019-12-27 20:20:24,370 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:24,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:24,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 383 states and 822 transitions. [2019-12-27 20:20:24,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:24,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:20:24,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:20:24,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:20:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:20:24,884 INFO L87 Difference]: Start difference. First operand 34692 states and 105548 transitions. Second operand 16 states. [2019-12-27 20:20:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:30,904 INFO L93 Difference]: Finished difference Result 71859 states and 211248 transitions. [2019-12-27 20:20:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 20:20:30,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 20:20:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:31,001 INFO L225 Difference]: With dead ends: 71859 [2019-12-27 20:20:31,002 INFO L226 Difference]: Without dead ends: 71779 [2019-12-27 20:20:31,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=517, Invalid=2345, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 20:20:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71779 states. [2019-12-27 20:20:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71779 to 40684. [2019-12-27 20:20:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40684 states. [2019-12-27 20:20:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40684 states to 40684 states and 123211 transitions. [2019-12-27 20:20:31,906 INFO L78 Accepts]: Start accepts. Automaton has 40684 states and 123211 transitions. Word has length 66 [2019-12-27 20:20:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:31,907 INFO L462 AbstractCegarLoop]: Abstraction has 40684 states and 123211 transitions. [2019-12-27 20:20:31,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:20:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 40684 states and 123211 transitions. [2019-12-27 20:20:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:20:31,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:31,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:31,950 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -780433379, now seen corresponding path program 3 times [2019-12-27 20:20:31,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:31,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863907741] [2019-12-27 20:20:31,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:32,012 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:20:32,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863907741] [2019-12-27 20:20:32,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:32,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:20:32,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [84465812] [2019-12-27 20:20:32,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:32,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:32,307 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 593 transitions. [2019-12-27 20:20:32,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:32,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:20:32,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:20:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:20:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:20:32,309 INFO L87 Difference]: Start difference. First operand 40684 states and 123211 transitions. Second operand 3 states. [2019-12-27 20:20:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:32,430 INFO L93 Difference]: Finished difference Result 40683 states and 123209 transitions. [2019-12-27 20:20:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:20:32,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:20:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:32,487 INFO L225 Difference]: With dead ends: 40683 [2019-12-27 20:20:32,487 INFO L226 Difference]: Without dead ends: 40683 [2019-12-27 20:20:32,487 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:20:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40683 states. [2019-12-27 20:20:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40683 to 31430. [2019-12-27 20:20:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31430 states. [2019-12-27 20:20:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31430 states to 31430 states and 96353 transitions. [2019-12-27 20:20:33,309 INFO L78 Accepts]: Start accepts. Automaton has 31430 states and 96353 transitions. Word has length 66 [2019-12-27 20:20:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:33,309 INFO L462 AbstractCegarLoop]: Abstraction has 31430 states and 96353 transitions. [2019-12-27 20:20:33,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:20:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 31430 states and 96353 transitions. [2019-12-27 20:20:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:20:33,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:33,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:33,343 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2031700337, now seen corresponding path program 1 times [2019-12-27 20:20:33,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:33,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228366615] [2019-12-27 20:20:33,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:34,421 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:20:34,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228366615] [2019-12-27 20:20:34,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:34,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:20:34,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924375455] [2019-12-27 20:20:34,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:34,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:34,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 384 states and 823 transitions. [2019-12-27 20:20:34,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:20:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 20:20:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:20:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:20:36,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 72 times. [2019-12-27 20:20:36,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 20:20:36,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 20:20:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:20:36,794 INFO L87 Difference]: Start difference. First operand 31430 states and 96353 transitions. Second operand 29 states. [2019-12-27 20:20:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:42,313 INFO L93 Difference]: Finished difference Result 46435 states and 139865 transitions. [2019-12-27 20:20:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:20:42,314 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2019-12-27 20:20:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:42,377 INFO L225 Difference]: With dead ends: 46435 [2019-12-27 20:20:42,377 INFO L226 Difference]: Without dead ends: 44405 [2019-12-27 20:20:42,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 37 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=404, Invalid=2458, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 20:20:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44405 states. [2019-12-27 20:20:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44405 to 39025. [2019-12-27 20:20:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39025 states. [2019-12-27 20:20:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39025 states to 39025 states and 117996 transitions. [2019-12-27 20:20:43,034 INFO L78 Accepts]: Start accepts. Automaton has 39025 states and 117996 transitions. Word has length 67 [2019-12-27 20:20:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:43,035 INFO L462 AbstractCegarLoop]: Abstraction has 39025 states and 117996 transitions. [2019-12-27 20:20:43,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 20:20:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 39025 states and 117996 transitions. [2019-12-27 20:20:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:20:43,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:43,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:43,080 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:43,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-27 20:20:43,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:43,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145676957] [2019-12-27 20:20:43,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:43,758 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:20:43,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145676957] [2019-12-27 20:20:43,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:43,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:20:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758604372] [2019-12-27 20:20:43,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:43,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:44,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 394 states and 842 transitions. [2019-12-27 20:20:44,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:44,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 20:20:44,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 20:20:44,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:44,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 20:20:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:20:44,823 INFO L87 Difference]: Start difference. First operand 39025 states and 117996 transitions. Second operand 23 states. [2019-12-27 20:20:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:56,488 INFO L93 Difference]: Finished difference Result 119624 states and 357691 transitions. [2019-12-27 20:20:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-27 20:20:56,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 20:20:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:56,614 INFO L225 Difference]: With dead ends: 119624 [2019-12-27 20:20:56,614 INFO L226 Difference]: Without dead ends: 80961 [2019-12-27 20:20:56,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 19 SyntacticMatches, 19 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3672 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1538, Invalid=9804, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 20:20:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80961 states. [2019-12-27 20:20:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80961 to 39048. [2019-12-27 20:20:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39048 states. [2019-12-27 20:20:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39048 states to 39048 states and 117551 transitions. [2019-12-27 20:20:57,907 INFO L78 Accepts]: Start accepts. Automaton has 39048 states and 117551 transitions. Word has length 67 [2019-12-27 20:20:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:20:57,907 INFO L462 AbstractCegarLoop]: Abstraction has 39048 states and 117551 transitions. [2019-12-27 20:20:57,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 20:20:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39048 states and 117551 transitions. [2019-12-27 20:20:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:20:57,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:20:57,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:20:57,949 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:20:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:20:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1653481189, now seen corresponding path program 3 times [2019-12-27 20:20:57,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:20:57,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123530023] [2019-12-27 20:20:57,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:20:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:20:58,027 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:20:58,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123530023] [2019-12-27 20:20:58,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:20:58,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:20:58,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686060380] [2019-12-27 20:20:58,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:20:58,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:20:58,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 345 states and 703 transitions. [2019-12-27 20:20:58,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:20:58,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:20:58,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:20:58,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:20:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:20:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:20:58,566 INFO L87 Difference]: Start difference. First operand 39048 states and 117551 transitions. Second operand 10 states. [2019-12-27 20:20:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:20:59,570 INFO L93 Difference]: Finished difference Result 81170 states and 242863 transitions. [2019-12-27 20:20:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:20:59,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 20:20:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:20:59,659 INFO L225 Difference]: With dead ends: 81170 [2019-12-27 20:20:59,659 INFO L226 Difference]: Without dead ends: 56019 [2019-12-27 20:20:59,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:20:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56019 states. [2019-12-27 20:21:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56019 to 35627. [2019-12-27 20:21:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35627 states. [2019-12-27 20:21:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35627 states to 35627 states and 106992 transitions. [2019-12-27 20:21:00,373 INFO L78 Accepts]: Start accepts. Automaton has 35627 states and 106992 transitions. Word has length 67 [2019-12-27 20:21:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:00,373 INFO L462 AbstractCegarLoop]: Abstraction has 35627 states and 106992 transitions. [2019-12-27 20:21:00,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:21:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35627 states and 106992 transitions. [2019-12-27 20:21:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:00,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:00,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:00,413 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 108197429, now seen corresponding path program 4 times [2019-12-27 20:21:00,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:00,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381628720] [2019-12-27 20:21:00,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:00,950 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:21:00,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381628720] [2019-12-27 20:21:00,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:00,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 20:21:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102303753] [2019-12-27 20:21:00,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:01,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:01,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 329 states and 671 transitions. [2019-12-27 20:21:01,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:02,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:21:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:03,109 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 20:21:03,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 57 times. [2019-12-27 20:21:03,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 20:21:03,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 20:21:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:21:03,111 INFO L87 Difference]: Start difference. First operand 35627 states and 106992 transitions. Second operand 32 states. [2019-12-27 20:21:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:11,431 INFO L93 Difference]: Finished difference Result 46320 states and 136704 transitions. [2019-12-27 20:21:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 20:21:11,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-12-27 20:21:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:11,477 INFO L225 Difference]: With dead ends: 46320 [2019-12-27 20:21:11,477 INFO L226 Difference]: Without dead ends: 33470 [2019-12-27 20:21:11,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 25 SyntacticMatches, 24 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=883, Invalid=5279, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 20:21:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33470 states. [2019-12-27 20:21:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33470 to 31594. [2019-12-27 20:21:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31594 states. [2019-12-27 20:21:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31594 states to 31594 states and 95063 transitions. [2019-12-27 20:21:11,939 INFO L78 Accepts]: Start accepts. Automaton has 31594 states and 95063 transitions. Word has length 67 [2019-12-27 20:21:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:11,939 INFO L462 AbstractCegarLoop]: Abstraction has 31594 states and 95063 transitions. [2019-12-27 20:21:11,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 20:21:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31594 states and 95063 transitions. [2019-12-27 20:21:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:11,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:11,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:11,973 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -990275769, now seen corresponding path program 5 times [2019-12-27 20:21:11,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:11,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99622750] [2019-12-27 20:21:11,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:12,813 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:21:12,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99622750] [2019-12-27 20:21:12,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:12,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:21:12,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1202877238] [2019-12-27 20:21:12,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:12,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:13,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 339 states and 698 transitions. [2019-12-27 20:21:13,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:14,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 20:21:14,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 20:21:14,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 20:21:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:21:14,894 INFO L87 Difference]: Start difference. First operand 31594 states and 95063 transitions. Second operand 29 states. [2019-12-27 20:21:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:22,870 INFO L93 Difference]: Finished difference Result 37556 states and 111415 transitions. [2019-12-27 20:21:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 20:21:22,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2019-12-27 20:21:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:22,919 INFO L225 Difference]: With dead ends: 37556 [2019-12-27 20:21:22,919 INFO L226 Difference]: Without dead ends: 34328 [2019-12-27 20:21:22,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=537, Invalid=2655, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:21:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34328 states. [2019-12-27 20:21:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34328 to 31774. [2019-12-27 20:21:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31774 states. [2019-12-27 20:21:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31774 states to 31774 states and 95565 transitions. [2019-12-27 20:21:23,404 INFO L78 Accepts]: Start accepts. Automaton has 31774 states and 95565 transitions. Word has length 67 [2019-12-27 20:21:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:23,404 INFO L462 AbstractCegarLoop]: Abstraction has 31774 states and 95565 transitions. [2019-12-27 20:21:23,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 20:21:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31774 states and 95565 transitions. [2019-12-27 20:21:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:23,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:23,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:23,440 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1225077105, now seen corresponding path program 6 times [2019-12-27 20:21:23,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:23,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591306927] [2019-12-27 20:21:23,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:23,946 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:21:23,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591306927] [2019-12-27 20:21:23,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:23,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:21:23,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831115255] [2019-12-27 20:21:23,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:23,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:24,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 337 states and 696 transitions. [2019-12-27 20:21:24,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:24,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 20:21:24,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 20:21:24,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 20:21:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:21:24,854 INFO L87 Difference]: Start difference. First operand 31774 states and 95565 transitions. Second operand 24 states. [2019-12-27 20:21:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:30,178 INFO L93 Difference]: Finished difference Result 51350 states and 151455 transitions. [2019-12-27 20:21:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 20:21:30,179 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 20:21:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:30,244 INFO L225 Difference]: With dead ends: 51350 [2019-12-27 20:21:30,245 INFO L226 Difference]: Without dead ends: 47709 [2019-12-27 20:21:30,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=398, Invalid=2794, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:21:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47709 states. [2019-12-27 20:21:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47709 to 32838. [2019-12-27 20:21:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32838 states. [2019-12-27 20:21:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32838 states to 32838 states and 98186 transitions. [2019-12-27 20:21:30,854 INFO L78 Accepts]: Start accepts. Automaton has 32838 states and 98186 transitions. Word has length 67 [2019-12-27 20:21:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:30,854 INFO L462 AbstractCegarLoop]: Abstraction has 32838 states and 98186 transitions. [2019-12-27 20:21:30,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 20:21:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 32838 states and 98186 transitions. [2019-12-27 20:21:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:30,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:30,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:30,892 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 358584945, now seen corresponding path program 7 times [2019-12-27 20:21:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410279846] [2019-12-27 20:21:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:31,359 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:21:31,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410279846] [2019-12-27 20:21:31,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:31,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:21:31,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609758146] [2019-12-27 20:21:31,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:31,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:31,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 580 transitions. [2019-12-27 20:21:31,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:32,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:21:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:21:32,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 20:21:32,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 20:21:32,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 20:21:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:21:32,562 INFO L87 Difference]: Start difference. First operand 32838 states and 98186 transitions. Second operand 28 states. [2019-12-27 20:21:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:42,536 INFO L93 Difference]: Finished difference Result 68056 states and 200774 transitions. [2019-12-27 20:21:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 20:21:42,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2019-12-27 20:21:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:42,614 INFO L225 Difference]: With dead ends: 68056 [2019-12-27 20:21:42,614 INFO L226 Difference]: Without dead ends: 52934 [2019-12-27 20:21:42,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1152, Invalid=6680, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 20:21:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52934 states. [2019-12-27 20:21:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52934 to 25800. [2019-12-27 20:21:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25800 states. [2019-12-27 20:21:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25800 states to 25800 states and 78430 transitions. [2019-12-27 20:21:43,227 INFO L78 Accepts]: Start accepts. Automaton has 25800 states and 78430 transitions. Word has length 67 [2019-12-27 20:21:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:43,227 INFO L462 AbstractCegarLoop]: Abstraction has 25800 states and 78430 transitions. [2019-12-27 20:21:43,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 20:21:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25800 states and 78430 transitions. [2019-12-27 20:21:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:43,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:43,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:43,257 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2031673655, now seen corresponding path program 8 times [2019-12-27 20:21:43,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:43,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410757206] [2019-12-27 20:21:43,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:21:43,518 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:21:43,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410757206] [2019-12-27 20:21:43,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:21:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:21:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347624164] [2019-12-27 20:21:43,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:21:43,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:21:43,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 330 states and 677 transitions. [2019-12-27 20:21:43,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:21:44,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:21:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:21:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:21:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:21:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:21:44,182 INFO L87 Difference]: Start difference. First operand 25800 states and 78430 transitions. Second operand 15 states. [2019-12-27 20:21:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:21:46,160 INFO L93 Difference]: Finished difference Result 50705 states and 153938 transitions. [2019-12-27 20:21:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 20:21:46,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:21:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:21:46,218 INFO L225 Difference]: With dead ends: 50705 [2019-12-27 20:21:46,218 INFO L226 Difference]: Without dead ends: 42024 [2019-12-27 20:21:46,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:21:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42024 states. [2019-12-27 20:21:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42024 to 24519. [2019-12-27 20:21:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24519 states. [2019-12-27 20:21:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24519 states to 24519 states and 74766 transitions. [2019-12-27 20:21:46,705 INFO L78 Accepts]: Start accepts. Automaton has 24519 states and 74766 transitions. Word has length 67 [2019-12-27 20:21:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:21:46,705 INFO L462 AbstractCegarLoop]: Abstraction has 24519 states and 74766 transitions. [2019-12-27 20:21:46,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:21:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 24519 states and 74766 transitions. [2019-12-27 20:21:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:21:46,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:21:46,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:21:46,729 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:21:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:21:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 9 times [2019-12-27 20:21:46,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:21:46,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13175400] [2019-12-27 20:21:46,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:21:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:21:46,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:21:46,880 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:21:46,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t497~0.base_21| 4) |v_#length_21|) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= (store .cse0 |v_ULTIMATE.start_main_~#t497~0.base_21| 1) |v_#valid_60|) (< 0 |v_#StackHeapBarrier_15|) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t497~0.base_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~y~0_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t497~0.base_21|) 0) (= 0 |v_ULTIMATE.start_main_~#t497~0.offset_16|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_21|) |v_ULTIMATE.start_main_~#t497~0.offset_16| 0))) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t497~0.base=|v_ULTIMATE.start_main_~#t497~0.base_21|, ~x~0=v_~x~0_17, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t497~0.offset=|v_ULTIMATE.start_main_~#t497~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_15|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t498~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t499~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t497~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t498~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t497~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-27 20:21:46,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:21:46,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11|) |v_ULTIMATE.start_main_~#t498~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t498~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t498~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t498~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t498~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_10|, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t498~0.offset, ULTIMATE.start_main_~#t498~0.base, #length] because there is no mapped edge [2019-12-27 20:21:46,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t499~0.base_12| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t499~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t499~0.offset_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t499~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12|) |v_ULTIMATE.start_main_~#t499~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t499~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-27 20:21:46,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1435296545| |P1Thread1of1ForFork2_#t~ite9_Out-1435296545|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1435296545 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1435296545 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1435296545| ~z~0_In-1435296545) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1435296545| ~z$w_buff1~0_In-1435296545) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1435296545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435296545, ~z$w_buff1~0=~z$w_buff1~0_In-1435296545, ~z~0=~z~0_In-1435296545} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1435296545|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1435296545, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1435296545|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435296545, ~z$w_buff1~0=~z$w_buff1~0_In-1435296545, ~z~0=~z~0_In-1435296545} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:21:46,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In724936625 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out724936625| ~z$w_buff1~0_In724936625) (= |P2Thread1of1ForFork0_#t~ite23_In724936625| |P2Thread1of1ForFork0_#t~ite23_Out724936625|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out724936625| |P2Thread1of1ForFork0_#t~ite23_Out724936625|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In724936625 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In724936625 256))) (= (mod ~z$w_buff0_used~0_In724936625 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In724936625 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite23_Out724936625| ~z$w_buff1~0_In724936625)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In724936625, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In724936625|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In724936625, ~z$w_buff1~0=~z$w_buff1~0_In724936625, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In724936625, ~weak$$choice2~0=~weak$$choice2~0_In724936625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out724936625|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In724936625, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out724936625|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In724936625, ~z$w_buff1~0=~z$w_buff1~0_In724936625, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In724936625, ~weak$$choice2~0=~weak$$choice2~0_In724936625} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:21:46,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In821807400 256))) (.cse4 (= (mod ~z$w_buff1_used~0_In821807400 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In821807400 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out821807400| |P2Thread1of1ForFork0_#t~ite29_Out821807400|)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In821807400 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In821807400 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In821807400| |P2Thread1of1ForFork0_#t~ite28_Out821807400|) (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5) (= ~z$w_buff1_used~0_In821807400 |P2Thread1of1ForFork0_#t~ite29_Out821807400|)) (and (= |P2Thread1of1ForFork0_#t~ite30_Out821807400| ~z$w_buff1_used~0_In821807400) (= |P2Thread1of1ForFork0_#t~ite29_In821807400| |P2Thread1of1ForFork0_#t~ite29_Out821807400|) (not .cse0)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) (or (not .cse4) .cse6) .cse0 .cse1 (= |P2Thread1of1ForFork0_#t~ite28_Out821807400| |P2Thread1of1ForFork0_#t~ite29_Out821807400|) (not .cse5) (= |P2Thread1of1ForFork0_#t~ite28_Out821807400| 0))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In821807400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821807400, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821807400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821807400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821807400, ~weak$$choice2~0=~weak$$choice2~0_In821807400, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In821807400|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out821807400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821807400, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821807400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821807400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821807400, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out821807400|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out821807400|, ~weak$$choice2~0=~weak$$choice2~0_In821807400} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:21:46,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:21:46,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:21:46,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out1831141688| |P2Thread1of1ForFork0_#t~ite38_Out1831141688|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1831141688 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1831141688 256)))) (or (and (= ~z$w_buff1~0_In1831141688 |P2Thread1of1ForFork0_#t~ite38_Out1831141688|) .cse0 (not .cse1) (not .cse2)) (and (= ~z~0_In1831141688 |P2Thread1of1ForFork0_#t~ite38_Out1831141688|) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1831141688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831141688, ~z$w_buff1~0=~z$w_buff1~0_In1831141688, ~z~0=~z~0_In1831141688} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1831141688|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1831141688|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1831141688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831141688, ~z$w_buff1~0=~z$w_buff1~0_In1831141688, ~z~0=~z~0_In1831141688} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:21:46,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-663251354 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-663251354 256) 0))) (or (and (= ~z$w_buff0_used~0_In-663251354 |P2Thread1of1ForFork0_#t~ite40_Out-663251354|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-663251354|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-663251354, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663251354} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-663251354, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-663251354|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663251354} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:21:46,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1442716858 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1442716858 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1442716858 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1442716858 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1442716858| ~z$w_buff1_used~0_In-1442716858)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1442716858|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1442716858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1442716858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442716858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1442716858} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1442716858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1442716858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442716858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1442716858, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1442716858|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:21:46,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1356830127 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1356830127 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1356830127|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1356830127| ~z$r_buff0_thd3~0_In1356830127)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1356830127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1356830127} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1356830127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1356830127, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1356830127|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:21:46,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-532199682 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-532199682 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-532199682 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-532199682 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-532199682|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-532199682 |P2Thread1of1ForFork0_#t~ite43_Out-532199682|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-532199682, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-532199682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532199682, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-532199682} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-532199682|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-532199682, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-532199682, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532199682, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-532199682} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:21:46,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:21:46,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1248837731 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1248837731 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1248837731|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1248837731 |P0Thread1of1ForFork1_#t~ite5_Out-1248837731|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1248837731, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1248837731} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1248837731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1248837731, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1248837731} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:21:46,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In652403206 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In652403206 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In652403206 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In652403206 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out652403206| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In652403206 |P0Thread1of1ForFork1_#t~ite6_Out652403206|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In652403206, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In652403206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652403206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In652403206} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In652403206, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out652403206|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In652403206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652403206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In652403206} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:21:46,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1108306445 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1108306445 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1108306445) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In1108306445 ~z$r_buff0_thd1~0_Out1108306445)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1108306445} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1108306445|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1108306445} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:21:46,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1009272203 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1009272203 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1009272203 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1009272203 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1009272203|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1009272203 |P0Thread1of1ForFork1_#t~ite8_Out1009272203|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009272203} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1009272203|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009272203} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:21:46,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:21:46,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In432206974 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In432206974 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out432206974|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In432206974 |P1Thread1of1ForFork2_#t~ite11_Out432206974|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In432206974} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out432206974|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In432206974} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:21:46,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-569473029 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-569473029 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-569473029 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-569473029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-569473029 |P1Thread1of1ForFork2_#t~ite12_Out-569473029|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-569473029| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-569473029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-569473029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-569473029, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-569473029|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-569473029} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:21:46,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1333537956 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1333537956 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1333537956|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1333537956 |P1Thread1of1ForFork2_#t~ite13_Out1333537956|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333537956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1333537956|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333537956} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:21:46,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-956419072 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-956419072 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-956419072 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-956419072 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-956419072| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-956419072| ~z$r_buff1_thd2~0_In-956419072) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-956419072, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-956419072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-956419072, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-956419072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-956419072, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-956419072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-956419072, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-956419072|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-956419072} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:21:46,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:21:46,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:21:46,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1645016635 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1645016635 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1645016635 |ULTIMATE.start_main_#t~ite47_Out1645016635|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1645016635 |ULTIMATE.start_main_#t~ite47_Out1645016635|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645016635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645016635, ~z$w_buff1~0=~z$w_buff1~0_In1645016635, ~z~0=~z~0_In1645016635} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645016635, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1645016635|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645016635, ~z$w_buff1~0=~z$w_buff1~0_In1645016635, ~z~0=~z~0_In1645016635} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:21:46,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 20:21:46,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1004103431 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1004103431 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1004103431| ~z$w_buff0_used~0_In-1004103431) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1004103431| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1004103431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1004103431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1004103431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:21:46,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In876113550 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In876113550 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In876113550 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In876113550 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out876113550| ~z$w_buff1_used~0_In876113550) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out876113550|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In876113550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In876113550, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In876113550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876113550} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out876113550|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In876113550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In876113550, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In876113550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876113550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:21:46,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-884367973 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-884367973 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-884367973| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-884367973 |ULTIMATE.start_main_#t~ite51_Out-884367973|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-884367973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:21:46,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1254092638 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1254092638 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1254092638 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1254092638 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1254092638 |ULTIMATE.start_main_#t~ite52_Out1254092638|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1254092638|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1254092638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1254092638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1254092638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1254092638} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1254092638|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1254092638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1254092638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1254092638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1254092638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:21:46,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:21:47,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:21:47 BasicIcfg [2019-12-27 20:21:47,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:21:47,016 INFO L168 Benchmark]: Toolchain (without parser) took 211295.22 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 102.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,017 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 146.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.93 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.71 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,018 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,018 INFO L168 Benchmark]: RCFGBuilder took 922.10 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 101.2 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,019 INFO L168 Benchmark]: TraceAbstraction took 209427.03 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 20:21:47,020 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.16 ms. Allocated memory is still 146.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.93 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.71 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 922.10 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 101.2 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209427.03 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6457 VarBasedMoverChecksPositive, 198 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 209.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 112.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9853 SDtfs, 17406 SDslu, 54274 SDs, 0 SdLazy, 62366 SolverSat, 1530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1346 GetRequests, 262 SyntacticMatches, 190 SemanticMatches, 894 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14245 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 470732 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1565 NumberOfCodeBlocks, 1565 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 577791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...