/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:23,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:23,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:23,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:23,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:23,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:23,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:23,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:23,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:23,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:23,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:23,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:23,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:23,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:23,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:23,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:23,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:23,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:23,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:23,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:23,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:23,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:23,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:23,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:23,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:23,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:23,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:23,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:23,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:23,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:23,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:23,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:23,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:23,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:23,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:23,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:23,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:23,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:23,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:23,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:23,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:23,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:31:23,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:23,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:23,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:23,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:23,538 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:23,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:23,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:23,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:23,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:23,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:23,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:23,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:23,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:23,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:23,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:23,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:23,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:23,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:23,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:23,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:23,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:23,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:23,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:23,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:23,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:23,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:23,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:23,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:23,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:23,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:23,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:23,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:23,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:23,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:23,884 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:23,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-18 13:31:23,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713a41bb1/a5cfe1ba6d75492c935cdf59eb9fe2dc/FLAGd13d584f3 [2019-12-18 13:31:24,542 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:24,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-18 13:31:24,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713a41bb1/a5cfe1ba6d75492c935cdf59eb9fe2dc/FLAGd13d584f3 [2019-12-18 13:31:24,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713a41bb1/a5cfe1ba6d75492c935cdf59eb9fe2dc [2019-12-18 13:31:24,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:24,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:24,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:24,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:24,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:24,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:24" (1/1) ... [2019-12-18 13:31:24,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e38b2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:24, skipping insertion in model container [2019-12-18 13:31:24,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:24" (1/1) ... [2019-12-18 13:31:24,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:24,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:25,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:25,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:25,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:25,535 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:25,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25 WrapperNode [2019-12-18 13:31:25,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:25,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:25,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:25,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:25,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:25,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:25,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:25,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:25,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (1/1) ... [2019-12-18 13:31:25,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:25,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:25,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:25,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:25,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (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-18 13:31:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:25,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:25,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:25,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:25,722 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:31:26,550 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:26,550 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:26,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:26 BoogieIcfgContainer [2019-12-18 13:31:26,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:26,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:26,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:26,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:26,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:24" (1/3) ... [2019-12-18 13:31:26,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:26, skipping insertion in model container [2019-12-18 13:31:26,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:25" (2/3) ... [2019-12-18 13:31:26,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:26, skipping insertion in model container [2019-12-18 13:31:26,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:26" (3/3) ... [2019-12-18 13:31:26,561 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-18 13:31:26,571 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:26,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:26,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:26,581 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,672 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,723 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,725 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:26,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:26,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:26,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:26,789 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:26,789 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:26,789 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:26,789 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:26,789 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:26,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:26,806 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:31:26,808 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:26,899 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:26,899 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:26,924 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:26,963 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:27,018 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:27,019 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:27,030 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:27,056 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:31:27,058 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:32,453 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:32,787 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:31:32,905 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:31:32,933 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:31:32,933 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:31:32,937 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:31:47,358 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:31:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:31:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:31:47,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:47,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:31:47,367 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-18 13:31:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:31:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:47,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153579078] [2019-12-18 13:31:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:47,568 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-18 13:31:47,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153579078] [2019-12-18 13:31:47,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:47,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759936264] [2019-12-18 13:31:47,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:47,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:47,595 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:31:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:50,837 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:31:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:50,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:31:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:51,456 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:31:51,456 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:31:51,458 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-18 13:31:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:31:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:31:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:32:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:32:00,710 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:32:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:00,710 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:32:00,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:32:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:32:00,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:00,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:00,715 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-18 13:32:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:32:00,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:00,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753573387] [2019-12-18 13:32:00,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:00,820 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-18 13:32:00,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753573387] [2019-12-18 13:32:00,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:00,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:00,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730114233] [2019-12-18 13:32:00,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:00,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:00,826 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:32:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:06,522 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:32:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:06,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:32:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:07,023 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:32:07,024 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:32:07,024 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-18 13:32:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:32:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:32:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:32:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:32:14,623 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:32:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:14,624 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:32:14,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:32:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:32:14,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:14,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:14,632 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-18 13:32:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:32:14,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:14,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055339683] [2019-12-18 13:32:14,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:14,751 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-18 13:32:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055339683] [2019-12-18 13:32:14,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:14,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:14,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774154499] [2019-12-18 13:32:14,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:14,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:14,754 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:32:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:14,884 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:32:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:14,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:32:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:14,976 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:32:14,977 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:32:14,977 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-18 13:32:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:32:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:32:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:32:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:32:20,001 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:32:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:20,002 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:32:20,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:32:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:32:20,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:20,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:20,006 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-18 13:32:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:32:20,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:20,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873199448] [2019-12-18 13:32:20,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:20,119 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-18 13:32:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873199448] [2019-12-18 13:32:20,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:20,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:20,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491378102] [2019-12-18 13:32:20,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:20,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:20,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:20,121 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:32:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:20,479 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:32:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:20,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:32:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:20,556 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:32:20,556 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:32:20,556 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-18 13:32:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:32:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:32:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:32:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:32:21,241 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:32:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:21,242 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:32:21,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:32:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:32:21,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:21,252 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-18 13:32:21,252 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-18 13:32:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:32:21,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:21,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761214624] [2019-12-18 13:32:21,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:21,349 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-18 13:32:21,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761214624] [2019-12-18 13:32:21,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:21,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:21,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394588916] [2019-12-18 13:32:21,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:21,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:21,352 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:32:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:21,934 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:32:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:21,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:32:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:22,002 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:32:22,002 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:32:22,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:32:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:32:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:32:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:32:22,945 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:32:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:22,945 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:32:22,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:32:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:32:22,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:22,957 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-18 13:32:22,957 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-18 13:32:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:32:22,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:22,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729981510] [2019-12-18 13:32:22,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:23,008 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-18 13:32:23,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729981510] [2019-12-18 13:32:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:23,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815121838] [2019-12-18 13:32:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:23,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:23,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:23,012 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:32:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:23,087 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:32:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:23,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:32:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:23,107 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:32:23,107 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:32:23,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:32:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:32:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:32:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:32:23,321 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:32:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:23,321 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:32:23,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:32:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:23,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:23,333 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-18 13:32:23,333 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-18 13:32:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:32:23,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:23,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090790492] [2019-12-18 13:32:23,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:23,375 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-18 13:32:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090790492] [2019-12-18 13:32:23,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:23,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426882290] [2019-12-18 13:32:23,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:23,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:23,377 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:32:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:23,475 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:32:23,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:23,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:23,502 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:32:23,502 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:32:23,503 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-18 13:32:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:32:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:32:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:32:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:32:23,742 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:32:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:23,743 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:32:23,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:32:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:23,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:23,752 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-18 13:32:23,753 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-18 13:32:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:32:23,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:23,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395396627] [2019-12-18 13:32:23,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:23,815 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-18 13:32:23,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395396627] [2019-12-18 13:32:23,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:23,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:23,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508201140] [2019-12-18 13:32:23,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:23,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:23,818 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:32:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:23,949 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:32:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:23,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:23,990 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:32:23,990 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:32:23,991 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-18 13:32:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:32:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:32:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:32:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:32:24,406 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:32:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:24,406 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:32:24,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:32:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:24,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:24,418 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-18 13:32:24,418 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-18 13:32:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:32:24,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:24,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791320572] [2019-12-18 13:32:24,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:24,496 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-18 13:32:24,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791320572] [2019-12-18 13:32:24,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:24,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:24,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228503155] [2019-12-18 13:32:24,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:24,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:24,499 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:32:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:25,082 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:32:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:25,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:32:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:25,134 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:32:25,134 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:32:25,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:32:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:32:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:32:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:32:25,503 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:32:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:32:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:32:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:32:25,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:25,520 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-18 13:32:25,520 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-18 13:32:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:32:25,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:25,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68890869] [2019-12-18 13:32:25,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:25,621 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-18 13:32:25,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68890869] [2019-12-18 13:32:25,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:25,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:25,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764367014] [2019-12-18 13:32:25,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:25,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:25,623 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:32:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:26,213 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:32:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:26,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:32:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:26,251 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:32:26,252 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:32:26,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:32:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:32:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:32:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:32:26,582 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:32:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:26,583 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:32:26,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:32:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:26,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:26,601 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-18 13:32:26,601 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-18 13:32:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:32:26,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:26,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060645342] [2019-12-18 13:32:26,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:26,853 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-18 13:32:26,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060645342] [2019-12-18 13:32:26,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:26,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:26,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428187283] [2019-12-18 13:32:26,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:26,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:26,856 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:32:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:28,091 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:32:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:28,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:32:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:28,146 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:32:28,147 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:32:28,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:32:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:32:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:32:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:32:28,585 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:32:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:28,585 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:32:28,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:32:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:28,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:28,605 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-18 13:32:28,606 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-18 13:32:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:28,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:32:28,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:28,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236805242] [2019-12-18 13:32:28,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:28,743 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-18 13:32:28,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236805242] [2019-12-18 13:32:28,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:28,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:28,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466077749] [2019-12-18 13:32:28,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:28,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:28,747 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:32:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:30,558 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:32:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:30,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:32:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:30,626 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:32:30,626 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:32:30,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:32:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:32:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:32:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:32:31,263 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:32:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:31,263 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:32:31,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:32:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:31,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:31,280 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] [2019-12-18 13:32:31,280 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-18 13:32:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:32:31,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:31,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510059704] [2019-12-18 13:32:31,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:31,420 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-18 13:32:31,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510059704] [2019-12-18 13:32:31,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:31,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:31,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447044755] [2019-12-18 13:32:31,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:31,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:31,423 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:32:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:32,768 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:32:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:32,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:32:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:32,817 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:32:32,818 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:32:32,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:32:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:32:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:32:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:32:33,208 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:32:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:33,209 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:32:33,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:32:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:33,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:33,227 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] [2019-12-18 13:32:33,227 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-18 13:32:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:32:33,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:33,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049220985] [2019-12-18 13:32:33,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:33,392 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-18 13:32:33,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049220985] [2019-12-18 13:32:33,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:33,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:32:33,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060467404] [2019-12-18 13:32:33,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:33,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:33,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:33,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:33,395 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 9 states. [2019-12-18 13:32:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:35,035 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 13:32:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:32:35,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 13:32:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:35,132 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 13:32:35,133 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 13:32:35,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:32:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 13:32:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 13:32:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 13:32:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 13:32:35,861 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 13:32:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:35,861 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 13:32:35,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 13:32:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:35,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:35,876 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] [2019-12-18 13:32:35,876 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-18 13:32:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:32:35,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:35,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277360448] [2019-12-18 13:32:35,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:36,062 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-18 13:32:36,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277360448] [2019-12-18 13:32:36,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:36,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:36,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169576992] [2019-12-18 13:32:36,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:32:36,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:32:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:32:36,064 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 10 states. [2019-12-18 13:32:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:38,160 INFO L93 Difference]: Finished difference Result 39194 states and 113902 transitions. [2019-12-18 13:32:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:38,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-18 13:32:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:38,226 INFO L225 Difference]: With dead ends: 39194 [2019-12-18 13:32:38,226 INFO L226 Difference]: Without dead ends: 39194 [2019-12-18 13:32:38,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39194 states. [2019-12-18 13:32:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39194 to 17513. [2019-12-18 13:32:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17513 states. [2019-12-18 13:32:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17513 states to 17513 states and 52269 transitions. [2019-12-18 13:32:38,624 INFO L78 Accepts]: Start accepts. Automaton has 17513 states and 52269 transitions. Word has length 34 [2019-12-18 13:32:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:38,624 INFO L462 AbstractCegarLoop]: Abstraction has 17513 states and 52269 transitions. [2019-12-18 13:32:38,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:32:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17513 states and 52269 transitions. [2019-12-18 13:32:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:32:38,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:38,646 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-18 13:32:38,647 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-18 13:32:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:38,647 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:32:38,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:38,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585278565] [2019-12-18 13:32:38,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:38,705 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-18 13:32:38,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585278565] [2019-12-18 13:32:38,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:38,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:32:38,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152511766] [2019-12-18 13:32:38,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:38,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:38,707 INFO L87 Difference]: Start difference. First operand 17513 states and 52269 transitions. Second operand 3 states. [2019-12-18 13:32:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:38,774 INFO L93 Difference]: Finished difference Result 17512 states and 52267 transitions. [2019-12-18 13:32:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:38,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:32:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:38,799 INFO L225 Difference]: With dead ends: 17512 [2019-12-18 13:32:38,799 INFO L226 Difference]: Without dead ends: 17512 [2019-12-18 13:32:38,799 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-18 13:32:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17512 states. [2019-12-18 13:32:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17512 to 17512. [2019-12-18 13:32:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17512 states. [2019-12-18 13:32:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17512 states to 17512 states and 52267 transitions. [2019-12-18 13:32:39,055 INFO L78 Accepts]: Start accepts. Automaton has 17512 states and 52267 transitions. Word has length 39 [2019-12-18 13:32:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:39,055 INFO L462 AbstractCegarLoop]: Abstraction has 17512 states and 52267 transitions. [2019-12-18 13:32:39,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 17512 states and 52267 transitions. [2019-12-18 13:32:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:39,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:39,079 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-18 13:32:39,080 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-18 13:32:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:32:39,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:39,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064516731] [2019-12-18 13:32:39,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:39,149 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-18 13:32:39,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064516731] [2019-12-18 13:32:39,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:39,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:39,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923326027] [2019-12-18 13:32:39,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:39,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:39,151 INFO L87 Difference]: Start difference. First operand 17512 states and 52267 transitions. Second operand 5 states. [2019-12-18 13:32:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:39,749 INFO L93 Difference]: Finished difference Result 25759 states and 76136 transitions. [2019-12-18 13:32:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:39,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:32:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:39,788 INFO L225 Difference]: With dead ends: 25759 [2019-12-18 13:32:39,789 INFO L226 Difference]: Without dead ends: 25759 [2019-12-18 13:32:39,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25759 states. [2019-12-18 13:32:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25759 to 23423. [2019-12-18 13:32:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23423 states. [2019-12-18 13:32:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23423 states to 23423 states and 69753 transitions. [2019-12-18 13:32:40,258 INFO L78 Accepts]: Start accepts. Automaton has 23423 states and 69753 transitions. Word has length 40 [2019-12-18 13:32:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:40,259 INFO L462 AbstractCegarLoop]: Abstraction has 23423 states and 69753 transitions. [2019-12-18 13:32:40,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 23423 states and 69753 transitions. [2019-12-18 13:32:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:40,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:40,283 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-18 13:32:40,283 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-18 13:32:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-18 13:32:40,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:40,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415372395] [2019-12-18 13:32:40,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:40,338 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-18 13:32:40,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415372395] [2019-12-18 13:32:40,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:40,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:40,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144818463] [2019-12-18 13:32:40,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:40,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:40,340 INFO L87 Difference]: Start difference. First operand 23423 states and 69753 transitions. Second operand 5 states. [2019-12-18 13:32:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:40,472 INFO L93 Difference]: Finished difference Result 22112 states and 66767 transitions. [2019-12-18 13:32:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:40,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:32:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:40,509 INFO L225 Difference]: With dead ends: 22112 [2019-12-18 13:32:40,509 INFO L226 Difference]: Without dead ends: 22112 [2019-12-18 13:32:40,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22112 states. [2019-12-18 13:32:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22112 to 21153. [2019-12-18 13:32:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21153 states. [2019-12-18 13:32:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21153 states to 21153 states and 64181 transitions. [2019-12-18 13:32:40,855 INFO L78 Accepts]: Start accepts. Automaton has 21153 states and 64181 transitions. Word has length 40 [2019-12-18 13:32:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:40,855 INFO L462 AbstractCegarLoop]: Abstraction has 21153 states and 64181 transitions. [2019-12-18 13:32:40,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21153 states and 64181 transitions. [2019-12-18 13:32:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:40,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:40,890 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] [2019-12-18 13:32:40,890 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-18 13:32:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-18 13:32:40,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:40,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226823680] [2019-12-18 13:32:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:41,042 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-18 13:32:41,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226823680] [2019-12-18 13:32:41,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:41,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:41,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714500869] [2019-12-18 13:32:41,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:41,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:41,044 INFO L87 Difference]: Start difference. First operand 21153 states and 64181 transitions. Second operand 9 states. [2019-12-18 13:32:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:42,513 INFO L93 Difference]: Finished difference Result 114335 states and 341728 transitions. [2019-12-18 13:32:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:42,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:42,667 INFO L225 Difference]: With dead ends: 114335 [2019-12-18 13:32:42,667 INFO L226 Difference]: Without dead ends: 103556 [2019-12-18 13:32:42,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:32:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103556 states. [2019-12-18 13:32:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103556 to 22814. [2019-12-18 13:32:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22814 states. [2019-12-18 13:32:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22814 states to 22814 states and 69397 transitions. [2019-12-18 13:32:43,863 INFO L78 Accepts]: Start accepts. Automaton has 22814 states and 69397 transitions. Word has length 64 [2019-12-18 13:32:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:43,863 INFO L462 AbstractCegarLoop]: Abstraction has 22814 states and 69397 transitions. [2019-12-18 13:32:43,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 22814 states and 69397 transitions. [2019-12-18 13:32:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:43,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:43,887 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] [2019-12-18 13:32:43,887 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-18 13:32:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-18 13:32:43,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:43,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562722710] [2019-12-18 13:32:43,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:43,999 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-18 13:32:43,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562722710] [2019-12-18 13:32:43,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:44,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:44,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746173930] [2019-12-18 13:32:44,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:44,001 INFO L87 Difference]: Start difference. First operand 22814 states and 69397 transitions. Second operand 9 states. [2019-12-18 13:32:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:45,787 INFO L93 Difference]: Finished difference Result 125837 states and 373837 transitions. [2019-12-18 13:32:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:32:45,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:45,908 INFO L225 Difference]: With dead ends: 125837 [2019-12-18 13:32:45,909 INFO L226 Difference]: Without dead ends: 86411 [2019-12-18 13:32:45,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:32:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86411 states. [2019-12-18 13:32:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86411 to 24813. [2019-12-18 13:32:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24813 states. [2019-12-18 13:32:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24813 states to 24813 states and 75324 transitions. [2019-12-18 13:32:47,078 INFO L78 Accepts]: Start accepts. Automaton has 24813 states and 75324 transitions. Word has length 64 [2019-12-18 13:32:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:47,079 INFO L462 AbstractCegarLoop]: Abstraction has 24813 states and 75324 transitions. [2019-12-18 13:32:47,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24813 states and 75324 transitions. [2019-12-18 13:32:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:47,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:47,109 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] [2019-12-18 13:32:47,109 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-18 13:32:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-18 13:32:47,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:47,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984617136] [2019-12-18 13:32:47,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:47,203 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-18 13:32:47,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984617136] [2019-12-18 13:32:47,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:47,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:47,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155627120] [2019-12-18 13:32:47,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:47,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:47,207 INFO L87 Difference]: Start difference. First operand 24813 states and 75324 transitions. Second operand 7 states. [2019-12-18 13:32:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:47,702 INFO L93 Difference]: Finished difference Result 66394 states and 198687 transitions. [2019-12-18 13:32:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:32:47,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:32:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:47,770 INFO L225 Difference]: With dead ends: 66394 [2019-12-18 13:32:47,770 INFO L226 Difference]: Without dead ends: 49496 [2019-12-18 13:32:47,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:32:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49496 states. [2019-12-18 13:32:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49496 to 29506. [2019-12-18 13:32:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29506 states. [2019-12-18 13:32:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29506 states to 29506 states and 89487 transitions. [2019-12-18 13:32:48,360 INFO L78 Accepts]: Start accepts. Automaton has 29506 states and 89487 transitions. Word has length 64 [2019-12-18 13:32:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:48,360 INFO L462 AbstractCegarLoop]: Abstraction has 29506 states and 89487 transitions. [2019-12-18 13:32:48,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 29506 states and 89487 transitions. [2019-12-18 13:32:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:48,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:48,391 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] [2019-12-18 13:32:48,392 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-18 13:32:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-18 13:32:48,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:48,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897122323] [2019-12-18 13:32:48,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:48,476 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-18 13:32:48,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897122323] [2019-12-18 13:32:48,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:48,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:48,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302446858] [2019-12-18 13:32:48,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:48,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:48,481 INFO L87 Difference]: Start difference. First operand 29506 states and 89487 transitions. Second operand 7 states. [2019-12-18 13:32:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:48,938 INFO L93 Difference]: Finished difference Result 61221 states and 181530 transitions. [2019-12-18 13:32:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:32:48,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:32:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:49,007 INFO L225 Difference]: With dead ends: 61221 [2019-12-18 13:32:49,008 INFO L226 Difference]: Without dead ends: 51364 [2019-12-18 13:32:49,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51364 states. [2019-12-18 13:32:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51364 to 29542. [2019-12-18 13:32:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29542 states. [2019-12-18 13:32:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29542 states to 29542 states and 89544 transitions. [2019-12-18 13:32:49,796 INFO L78 Accepts]: Start accepts. Automaton has 29542 states and 89544 transitions. Word has length 64 [2019-12-18 13:32:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:49,796 INFO L462 AbstractCegarLoop]: Abstraction has 29542 states and 89544 transitions. [2019-12-18 13:32:49,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 29542 states and 89544 transitions. [2019-12-18 13:32:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:49,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:49,827 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] [2019-12-18 13:32:49,827 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-18 13:32:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-18 13:32:49,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:49,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859247605] [2019-12-18 13:32:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:49,904 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-18 13:32:49,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859247605] [2019-12-18 13:32:49,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:49,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:49,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424808764] [2019-12-18 13:32:49,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:49,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:49,907 INFO L87 Difference]: Start difference. First operand 29542 states and 89544 transitions. Second operand 3 states. [2019-12-18 13:32:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:50,075 INFO L93 Difference]: Finished difference Result 34226 states and 103741 transitions. [2019-12-18 13:32:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:50,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:32:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:50,123 INFO L225 Difference]: With dead ends: 34226 [2019-12-18 13:32:50,123 INFO L226 Difference]: Without dead ends: 34226 [2019-12-18 13:32:50,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 13:32:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34226 states. [2019-12-18 13:32:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34226 to 29950. [2019-12-18 13:32:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29950 states. [2019-12-18 13:32:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29950 states to 29950 states and 91195 transitions. [2019-12-18 13:32:50,616 INFO L78 Accepts]: Start accepts. Automaton has 29950 states and 91195 transitions. Word has length 64 [2019-12-18 13:32:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:50,616 INFO L462 AbstractCegarLoop]: Abstraction has 29950 states and 91195 transitions. [2019-12-18 13:32:50,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29950 states and 91195 transitions. [2019-12-18 13:32:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:50,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:50,649 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-18 13:32:50,649 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-18 13:32:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-18 13:32:50,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:50,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821387783] [2019-12-18 13:32:50,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:50,692 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-18 13:32:50,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821387783] [2019-12-18 13:32:50,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:50,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:50,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369933673] [2019-12-18 13:32:50,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:50,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:50,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:50,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:50,693 INFO L87 Difference]: Start difference. First operand 29950 states and 91195 transitions. Second operand 3 states. [2019-12-18 13:32:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:51,031 INFO L93 Difference]: Finished difference Result 39713 states and 121222 transitions. [2019-12-18 13:32:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:51,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:32:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:51,125 INFO L225 Difference]: With dead ends: 39713 [2019-12-18 13:32:51,125 INFO L226 Difference]: Without dead ends: 39713 [2019-12-18 13:32:51,126 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-18 13:32:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39713 states. [2019-12-18 13:32:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39713 to 30458. [2019-12-18 13:32:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30458 states. [2019-12-18 13:32:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30458 states to 30458 states and 92836 transitions. [2019-12-18 13:32:51,833 INFO L78 Accepts]: Start accepts. Automaton has 30458 states and 92836 transitions. Word has length 65 [2019-12-18 13:32:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:51,833 INFO L462 AbstractCegarLoop]: Abstraction has 30458 states and 92836 transitions. [2019-12-18 13:32:51,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 30458 states and 92836 transitions. [2019-12-18 13:32:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:51,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:51,867 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-18 13:32:51,867 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-18 13:32:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-18 13:32:51,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:51,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641664951] [2019-12-18 13:32:51,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:51,979 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-18 13:32:51,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641664951] [2019-12-18 13:32:51,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:51,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:51,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21229882] [2019-12-18 13:32:51,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:51,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:51,982 INFO L87 Difference]: Start difference. First operand 30458 states and 92836 transitions. Second operand 9 states. [2019-12-18 13:32:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:53,580 INFO L93 Difference]: Finished difference Result 102850 states and 304007 transitions. [2019-12-18 13:32:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:32:53,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:32:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:53,718 INFO L225 Difference]: With dead ends: 102850 [2019-12-18 13:32:53,718 INFO L226 Difference]: Without dead ends: 92787 [2019-12-18 13:32:53,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92787 states. [2019-12-18 13:32:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92787 to 31383. [2019-12-18 13:32:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31383 states. [2019-12-18 13:32:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31383 states to 31383 states and 95473 transitions. [2019-12-18 13:32:54,683 INFO L78 Accepts]: Start accepts. Automaton has 31383 states and 95473 transitions. Word has length 65 [2019-12-18 13:32:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:54,684 INFO L462 AbstractCegarLoop]: Abstraction has 31383 states and 95473 transitions. [2019-12-18 13:32:54,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31383 states and 95473 transitions. [2019-12-18 13:32:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:54,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:54,720 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-18 13:32:54,720 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-18 13:32:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2044306796, now seen corresponding path program 2 times [2019-12-18 13:32:54,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:54,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961070155] [2019-12-18 13:32:54,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:54,840 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-18 13:32:54,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961070155] [2019-12-18 13:32:54,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:54,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:54,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246019477] [2019-12-18 13:32:54,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:54,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:54,842 INFO L87 Difference]: Start difference. First operand 31383 states and 95473 transitions. Second operand 9 states. [2019-12-18 13:32:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:56,376 INFO L93 Difference]: Finished difference Result 87578 states and 259288 transitions. [2019-12-18 13:32:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:32:56,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:32:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:56,503 INFO L225 Difference]: With dead ends: 87578 [2019-12-18 13:32:56,503 INFO L226 Difference]: Without dead ends: 83140 [2019-12-18 13:32:56,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83140 states. [2019-12-18 13:32:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83140 to 29947. [2019-12-18 13:32:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-18 13:32:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 90999 transitions. [2019-12-18 13:32:57,653 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 90999 transitions. Word has length 65 [2019-12-18 13:32:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:57,653 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 90999 transitions. [2019-12-18 13:32:57,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 90999 transitions. [2019-12-18 13:32:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:57,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:57,682 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-18 13:32:57,682 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-18 13:32:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1227831362, now seen corresponding path program 3 times [2019-12-18 13:32:57,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:57,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840798481] [2019-12-18 13:32:57,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:57,757 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-18 13:32:57,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840798481] [2019-12-18 13:32:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:57,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:57,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570727471] [2019-12-18 13:32:57,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:57,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:57,759 INFO L87 Difference]: Start difference. First operand 29947 states and 90999 transitions. Second operand 4 states. [2019-12-18 13:32:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:57,934 INFO L93 Difference]: Finished difference Result 29605 states and 89772 transitions. [2019-12-18 13:32:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:57,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:32:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:58,001 INFO L225 Difference]: With dead ends: 29605 [2019-12-18 13:32:58,001 INFO L226 Difference]: Without dead ends: 29605 [2019-12-18 13:32:58,001 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-18 13:32:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29605 states. [2019-12-18 13:32:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29605 to 27662. [2019-12-18 13:32:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27662 states. [2019-12-18 13:32:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27662 states to 27662 states and 83629 transitions. [2019-12-18 13:32:58,766 INFO L78 Accepts]: Start accepts. Automaton has 27662 states and 83629 transitions. Word has length 65 [2019-12-18 13:32:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:58,766 INFO L462 AbstractCegarLoop]: Abstraction has 27662 states and 83629 transitions. [2019-12-18 13:32:58,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27662 states and 83629 transitions. [2019-12-18 13:32:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:32:58,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:58,807 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-18 13:32:58,807 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-18 13:32:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1591414325, now seen corresponding path program 1 times [2019-12-18 13:32:58,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:58,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294587974] [2019-12-18 13:32:58,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:58,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-18 13:32:58,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294587974] [2019-12-18 13:32:58,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:58,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748679422] [2019-12-18 13:32:58,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:58,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:58,857 INFO L87 Difference]: Start difference. First operand 27662 states and 83629 transitions. Second operand 3 states. [2019-12-18 13:32:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:58,954 INFO L93 Difference]: Finished difference Result 24369 states and 72635 transitions. [2019-12-18 13:32:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:58,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:32:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:58,994 INFO L225 Difference]: With dead ends: 24369 [2019-12-18 13:32:58,994 INFO L226 Difference]: Without dead ends: 24369 [2019-12-18 13:32:58,994 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-18 13:32:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24369 states. [2019-12-18 13:32:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24369 to 23025. [2019-12-18 13:32:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23025 states. [2019-12-18 13:32:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23025 states to 23025 states and 68525 transitions. [2019-12-18 13:32:59,336 INFO L78 Accepts]: Start accepts. Automaton has 23025 states and 68525 transitions. Word has length 65 [2019-12-18 13:32:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:59,337 INFO L462 AbstractCegarLoop]: Abstraction has 23025 states and 68525 transitions. [2019-12-18 13:32:59,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23025 states and 68525 transitions. [2019-12-18 13:32:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:32:59,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:59,371 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-18 13:32:59,371 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-18 13:32:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-18 13:32:59,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:59,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939205946] [2019-12-18 13:32:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:59,428 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-18 13:32:59,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939205946] [2019-12-18 13:32:59,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:59,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:59,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886882036] [2019-12-18 13:32:59,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:59,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:59,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:59,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:59,430 INFO L87 Difference]: Start difference. First operand 23025 states and 68525 transitions. Second operand 3 states. [2019-12-18 13:32:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:59,510 INFO L93 Difference]: Finished difference Result 23025 states and 68524 transitions. [2019-12-18 13:32:59,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:59,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:32:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:59,542 INFO L225 Difference]: With dead ends: 23025 [2019-12-18 13:32:59,542 INFO L226 Difference]: Without dead ends: 23025 [2019-12-18 13:32:59,542 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-18 13:32:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23025 states. [2019-12-18 13:32:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23025 to 18324. [2019-12-18 13:32:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18324 states. [2019-12-18 13:32:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18324 states to 18324 states and 55214 transitions. [2019-12-18 13:32:59,987 INFO L78 Accepts]: Start accepts. Automaton has 18324 states and 55214 transitions. Word has length 66 [2019-12-18 13:32:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:59,987 INFO L462 AbstractCegarLoop]: Abstraction has 18324 states and 55214 transitions. [2019-12-18 13:32:59,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18324 states and 55214 transitions. [2019-12-18 13:33:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:33:00,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:00,007 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-18 13:33:00,007 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-18 13:33:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:33:00,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:00,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080346653] [2019-12-18 13:33:00,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:33:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:33:00,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:33:00,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:33:00,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55|) |v_ULTIMATE.start_main_~#t1111~0.offset_34| 0))) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_34|) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1111~0.base_55|) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55|)) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55| 1) |v_#valid_91|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_41|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_55|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_20|, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_19|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_28|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_34|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:33:00,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd1~0_Out843671253 ~a$r_buff0_thd1~0_In843671253) (= ~a$r_buff1_thd3~0_Out843671253 ~a$r_buff0_thd3~0_In843671253) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In843671253 0)) (= ~x~0_In843671253 ~__unbuffered_p0_EAX~0_Out843671253) (= ~a$r_buff0_thd0~0_In843671253 ~a$r_buff1_thd0~0_Out843671253) (= ~a$r_buff0_thd1~0_Out843671253 1) (= ~a$r_buff1_thd2~0_Out843671253 ~a$r_buff0_thd2~0_In843671253)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In843671253, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In843671253, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In843671253, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In843671253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In843671253, ~x~0=~x~0_In843671253} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out843671253, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out843671253, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out843671253, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out843671253, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out843671253, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In843671253, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In843671253, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In843671253, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out843671253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In843671253, ~x~0=~x~0_In843671253} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:33:00,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:33:00,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-18 13:33:00,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out979547575| |P1Thread1of1ForFork2_#t~ite10_Out979547575|)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In979547575 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In979547575 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out979547575| ~a$w_buff1~0_In979547575)) (and (= ~a~0_In979547575 |P1Thread1of1ForFork2_#t~ite9_Out979547575|) .cse1 (or .cse0 .cse2)))) InVars {~a~0=~a~0_In979547575, ~a$w_buff1~0=~a$w_buff1~0_In979547575, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In979547575, ~a$w_buff1_used~0=~a$w_buff1_used~0_In979547575} OutVars{~a~0=~a~0_In979547575, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out979547575|, ~a$w_buff1~0=~a$w_buff1~0_In979547575, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In979547575, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out979547575|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In979547575} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:33:00,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In2033779743 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2033779743 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out2033779743| ~a$w_buff0_used~0_In2033779743) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out2033779743| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2033779743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2033779743} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2033779743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2033779743, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2033779743|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:33:00,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In716087381 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In716087381 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In716087381 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In716087381 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out716087381| 0)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In716087381 |P1Thread1of1ForFork2_#t~ite12_Out716087381|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In716087381, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In716087381, ~a$w_buff0_used~0=~a$w_buff0_used~0_In716087381, ~a$w_buff1_used~0=~a$w_buff1_used~0_In716087381} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In716087381, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In716087381, ~a$w_buff0_used~0=~a$w_buff0_used~0_In716087381, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out716087381|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In716087381} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:33:00,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In170677124 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In170677124 256)))) (or (and .cse0 (= (mod ~a$r_buff1_thd3~0_In170677124 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In170677124 256)) (and (= 0 (mod ~a$w_buff1_used~0_In170677124 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite20_Out170677124| ~a$w_buff0~0_In170677124) (= |P2Thread1of1ForFork0_#t~ite21_Out170677124| |P2Thread1of1ForFork0_#t~ite20_Out170677124|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In170677124| |P2Thread1of1ForFork0_#t~ite20_Out170677124|) (= |P2Thread1of1ForFork0_#t~ite21_Out170677124| ~a$w_buff0~0_In170677124)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In170677124, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In170677124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In170677124, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In170677124, ~a$w_buff1_used~0=~a$w_buff1_used~0_In170677124, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In170677124|, ~weak$$choice2~0=~weak$$choice2~0_In170677124} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out170677124|, ~a$w_buff0~0=~a$w_buff0~0_In170677124, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In170677124, ~a$w_buff0_used~0=~a$w_buff0_used~0_In170677124, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In170677124, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out170677124|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In170677124, ~weak$$choice2~0=~weak$$choice2~0_In170677124} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:33:00,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-448822560 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-448822560 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-448822560| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-448822560| ~a$r_buff0_thd2~0_In-448822560) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-448822560, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-448822560} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-448822560, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-448822560, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-448822560|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:33:00,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1834817137 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1834817137 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1834817137 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1834817137 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1834817137|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd2~0_In-1834817137 |P1Thread1of1ForFork2_#t~ite14_Out-1834817137|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1834817137, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1834817137, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1834817137, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1834817137} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1834817137, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1834817137, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1834817137, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1834817137, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1834817137|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:33:00,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:33:00,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1454037074 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out1454037074| ~a$w_buff1~0_In1454037074) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1454037074 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1454037074 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In1454037074 256) 0)) (and (= 0 (mod ~a$r_buff1_thd3~0_In1454037074 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite23_Out1454037074| |P2Thread1of1ForFork0_#t~ite24_Out1454037074|)) (and (= ~a$w_buff1~0_In1454037074 |P2Thread1of1ForFork0_#t~ite24_Out1454037074|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1454037074| |P2Thread1of1ForFork0_#t~ite23_Out1454037074|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1454037074, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1454037074|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1454037074, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1454037074, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1454037074, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1454037074, ~weak$$choice2~0=~weak$$choice2~0_In1454037074} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1454037074, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1454037074|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1454037074|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1454037074, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1454037074, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1454037074, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1454037074, ~weak$$choice2~0=~weak$$choice2~0_In1454037074} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:33:00,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-15389930 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-15389930| |P2Thread1of1ForFork0_#t~ite26_Out-15389930|) (= |P2Thread1of1ForFork0_#t~ite26_Out-15389930| ~a$w_buff0_used~0_In-15389930) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-15389930 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-15389930 256)) .cse0) (and .cse0 (= (mod ~a$w_buff1_used~0_In-15389930 256) 0)) (= (mod ~a$w_buff0_used~0_In-15389930 256) 0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-15389930| |P2Thread1of1ForFork0_#t~ite26_Out-15389930|) (= |P2Thread1of1ForFork0_#t~ite27_Out-15389930| ~a$w_buff0_used~0_In-15389930)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-15389930|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-15389930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-15389930, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-15389930, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-15389930, ~weak$$choice2~0=~weak$$choice2~0_In-15389930} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-15389930|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-15389930|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-15389930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-15389930, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-15389930, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-15389930, ~weak$$choice2~0=~weak$$choice2~0_In-15389930} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:33:00,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:33:00,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:33:00,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1607855401 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1607855401 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1607855401 |P2Thread1of1ForFork0_#t~ite38_Out1607855401|)) (and (or .cse1 .cse0) (= ~a~0_In1607855401 |P2Thread1of1ForFork0_#t~ite38_Out1607855401|)))) InVars {~a~0=~a~0_In1607855401, ~a$w_buff1~0=~a$w_buff1~0_In1607855401, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1607855401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1607855401} OutVars{~a~0=~a~0_In1607855401, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1607855401|, ~a$w_buff1~0=~a$w_buff1~0_In1607855401, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1607855401, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1607855401} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:33:00,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:33:00,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In421473573 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In421473573 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out421473573| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In421473573 |P2Thread1of1ForFork0_#t~ite40_Out421473573|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In421473573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In421473573} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out421473573|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In421473573, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In421473573} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:33:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In865747175 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In865747175 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out865747175| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out865747175| ~a$w_buff0_used~0_In865747175) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In865747175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In865747175} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out865747175|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In865747175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In865747175} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:33:00,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In397581281 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In397581281 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In397581281 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In397581281 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out397581281| ~a$w_buff1_used~0_In397581281) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out397581281| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In397581281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In397581281, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In397581281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In397581281} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out397581281|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In397581281, ~a$w_buff0_used~0=~a$w_buff0_used~0_In397581281, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In397581281, ~a$w_buff1_used~0=~a$w_buff1_used~0_In397581281} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:33:00,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1290994840 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1290994840 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out1290994840 ~a$r_buff0_thd1~0_In1290994840) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out1290994840)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1290994840, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1290994840} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1290994840|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1290994840, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1290994840} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:33:00,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1376933276 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1376933276 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-1376933276 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1376933276 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1376933276|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1376933276| ~a$r_buff1_thd1~0_In-1376933276)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1376933276, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376933276, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1376933276, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376933276} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1376933276|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1376933276, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376933276, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1376933276, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376933276} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:33:00,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:33:00,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1704629728 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1704629728 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1704629728 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1704629728 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1704629728| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1704629728| ~a$w_buff1_used~0_In-1704629728) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1704629728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1704629728, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1704629728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1704629728} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1704629728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1704629728, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1704629728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1704629728, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1704629728|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:33:00,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In962858127 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In962858127 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out962858127|) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In962858127 |P2Thread1of1ForFork0_#t~ite42_Out962858127|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In962858127, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In962858127} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In962858127, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In962858127, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out962858127|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:33:00,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In1054287680 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1054287680 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1054287680 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1054287680 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1054287680|)) (and (= ~a$r_buff1_thd3~0_In1054287680 |P2Thread1of1ForFork0_#t~ite43_Out1054287680|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1054287680, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1054287680, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1054287680, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1054287680} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1054287680|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1054287680, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1054287680, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1054287680, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1054287680} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:33:00,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:33:00,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:33:00,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1520948702| |ULTIMATE.start_main_#t~ite48_Out1520948702|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1520948702 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In1520948702 256) 0))) (or (and .cse0 (not .cse1) (= ~a$w_buff1~0_In1520948702 |ULTIMATE.start_main_#t~ite47_Out1520948702|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1520948702| ~a~0_In1520948702)))) InVars {~a~0=~a~0_In1520948702, ~a$w_buff1~0=~a$w_buff1~0_In1520948702, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1520948702, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1520948702} OutVars{~a~0=~a~0_In1520948702, ~a$w_buff1~0=~a$w_buff1~0_In1520948702, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1520948702|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1520948702, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1520948702|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1520948702} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:33:00,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-455228756 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-455228756 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-455228756|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-455228756 |ULTIMATE.start_main_#t~ite49_Out-455228756|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-455228756, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-455228756} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-455228756, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-455228756|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-455228756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:33:00,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In352379843 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In352379843 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In352379843 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In352379843 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out352379843| ~a$w_buff1_used~0_In352379843)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite50_Out352379843| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In352379843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In352379843, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In352379843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In352379843} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out352379843|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In352379843, ~a$w_buff0_used~0=~a$w_buff0_used~0_In352379843, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In352379843, ~a$w_buff1_used~0=~a$w_buff1_used~0_In352379843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:33:00,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1729081293 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1729081293 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1729081293| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1729081293| ~a$r_buff0_thd0~0_In1729081293)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1729081293, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1729081293} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1729081293|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1729081293, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1729081293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:33:00,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1037556026 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1037556026 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1037556026 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1037556026 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1037556026| ~a$r_buff1_thd0~0_In1037556026) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1037556026| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1037556026, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1037556026, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1037556026, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1037556026} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1037556026|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1037556026, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1037556026, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1037556026, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1037556026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:33:00,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:33:00,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:33:00 BasicIcfg [2019-12-18 13:33:00,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:33:00,245 INFO L168 Benchmark]: Toolchain (without parser) took 95477.67 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 103.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,246 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 145.2 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.10 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 103.4 MB in the beginning and 156.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.09 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,248 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,248 INFO L168 Benchmark]: RCFGBuilder took 901.99 ms. Allocated memory is still 205.0 MB. Free memory was 151.4 MB in the beginning and 100.5 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,249 INFO L168 Benchmark]: TraceAbstraction took 93690.70 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:33:00,251 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.59 ms. Allocated memory is still 145.2 MB. Free memory was 123.8 MB in the beginning and 123.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.10 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 103.4 MB in the beginning and 156.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.09 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.60 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 901.99 ms. Allocated memory is still 205.0 MB. Free memory was 151.4 MB in the beginning and 100.5 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93690.70 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.3s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6815 SDtfs, 9946 SDslu, 18992 SDs, 0 SdLazy, 10828 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 44 SyntacticMatches, 16 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 37.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 492758 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 195205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...