/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/mix016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:38:12,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:38:12,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:38:12,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:38:12,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:38:12,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:38:12,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:38:12,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:38:12,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:38:12,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:38:12,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:38:12,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:38:12,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:38:12,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:38:12,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:38:12,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:38:12,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:38:12,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:38:12,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:38:12,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:38:12,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:38:12,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:38:12,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:38:12,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:38:12,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:38:12,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:38:12,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:38:12,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:38:12,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:38:12,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:38:12,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:38:12,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:38:12,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:38:12,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:38:12,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:38:12,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:38:12,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:38:12,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:38:12,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:38:12,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:38:12,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:38:12,289 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-26 21:38:12,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:38:12,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:38:12,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:38:12,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:38:12,326 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:38:12,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:38:12,326 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:38:12,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:38:12,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:38:12,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:38:12,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:38:12,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:38:12,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:38:12,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:38:12,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:38:12,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:38:12,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:38:12,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:38:12,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:38:12,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:38:12,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:38:12,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:38:12,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:38:12,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:38:12,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:38:12,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:38:12,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:38:12,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:38:12,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:38:12,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:38:12,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-26 21:38:12,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897c0f48c/d6c60152ac3a46c1a70fc408e4efc106/FLAGc123b358e [2019-12-26 21:38:13,315 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:38:13,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-26 21:38:13,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897c0f48c/d6c60152ac3a46c1a70fc408e4efc106/FLAGc123b358e [2019-12-26 21:38:13,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897c0f48c/d6c60152ac3a46c1a70fc408e4efc106 [2019-12-26 21:38:13,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:38:13,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:38:13,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:38:13,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:38:13,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:38:13,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:13, skipping insertion in model container [2019-12-26 21:38:13,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:38:13" (1/1) ... [2019-12-26 21:38:13,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:38:13,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:38:14,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:38:14,316 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:38:14,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:38:14,470 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:38:14,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14 WrapperNode [2019-12-26 21:38:14,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:38:14,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:38:14,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:38:14,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:38:14,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:38:14,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:38:14,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:38:14,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:38:14,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (1/1) ... [2019-12-26 21:38:14,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:38:14,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:38:14,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:38:14,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:38:14,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (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-26 21:38:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:38:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:38:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:38:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:38:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:38:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:38:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:38:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:38:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:38:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:38:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:38:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:38:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:38:14,723 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:38:15,657 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:38:15,658 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:38:15,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:38:15 BoogieIcfgContainer [2019-12-26 21:38:15,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:38:15,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:38:15,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:38:15,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:38:15,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:38:13" (1/3) ... [2019-12-26 21:38:15,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a81f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:38:15, skipping insertion in model container [2019-12-26 21:38:15,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:38:14" (2/3) ... [2019-12-26 21:38:15,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a81f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:38:15, skipping insertion in model container [2019-12-26 21:38:15,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:38:15" (3/3) ... [2019-12-26 21:38:15,669 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2019-12-26 21:38:15,680 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:38:15,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:38:15,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:38:15,690 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:38:15,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,756 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,757 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:38:15,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:38:15,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:38:15,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:38:15,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:38:15,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:38:15,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:38:15,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:38:15,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:38:15,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:38:15,918 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 21:38:15,919 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:38:16,019 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:38:16,020 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:38:16,036 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 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:38:16,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:38:16,123 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:38:16,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:38:16,134 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 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:38:16,162 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:38:16,163 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:38:21,214 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-26 21:38:21,317 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-26 21:38:21,541 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:38:21,658 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 21:38:21,688 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-26 21:38:21,688 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 21:38:21,692 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-26 21:38:37,316 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-26 21:38:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-26 21:38:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:38:37,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:37,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:38:37,325 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-26 21:38:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-26 21:38:37,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:37,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896601807] [2019-12-26 21:38:37,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:37,540 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-26 21:38:37,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896601807] [2019-12-26 21:38:37,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:37,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:38:37,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778804891] [2019-12-26 21:38:37,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:37,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:37,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:37,567 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-26 21:38:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:40,729 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-26 21:38:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:40,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:38:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:41,424 INFO L225 Difference]: With dead ends: 106034 [2019-12-26 21:38:41,425 INFO L226 Difference]: Without dead ends: 99950 [2019-12-26 21:38:41,428 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-26 21:38:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-26 21:38:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-26 21:38:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-26 21:38:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-26 21:38:53,808 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-26 21:38:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:53,808 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-26 21:38:53,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-26 21:38:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:38:53,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:53,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:53,814 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-26 21:38:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-26 21:38:53,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:53,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894943529] [2019-12-26 21:38:53,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:53,982 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-26 21:38:53,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894943529] [2019-12-26 21:38:53,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:53,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:53,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750599778] [2019-12-26 21:38:53,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:53,988 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-26 21:38:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:55,033 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-26 21:38:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:55,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:38:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:55,568 INFO L225 Difference]: With dead ends: 159384 [2019-12-26 21:38:55,569 INFO L226 Difference]: Without dead ends: 159335 [2019-12-26 21:38:55,570 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-26 21:39:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-26 21:39:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-26 21:39:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-26 21:39:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-26 21:39:07,706 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-26 21:39:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:07,706 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-26 21:39:07,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-26 21:39:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:39:07,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:07,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:07,714 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-26 21:39:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-26 21:39:07,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:07,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936079491] [2019-12-26 21:39:07,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:07,821 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-26 21:39:07,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936079491] [2019-12-26 21:39:07,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:07,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:07,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777070666] [2019-12-26 21:39:07,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:07,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:07,824 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-26 21:39:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:14,718 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-26 21:39:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:39:14,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:39:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:15,379 INFO L225 Difference]: With dead ends: 202801 [2019-12-26 21:39:15,379 INFO L226 Difference]: Without dead ends: 202745 [2019-12-26 21:39:15,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:39:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-26 21:39:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-26 21:39:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-26 21:39:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-26 21:39:24,144 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-26 21:39:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:24,145 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-26 21:39:24,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-26 21:39:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:39:24,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:24,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:24,156 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-26 21:39:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-26 21:39:24,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:24,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72108941] [2019-12-26 21:39:24,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:24,270 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-26 21:39:24,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72108941] [2019-12-26 21:39:24,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:24,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:24,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717486853] [2019-12-26 21:39:24,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:24,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:24,276 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-26 21:39:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:30,949 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-26 21:39:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:39:30,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:39:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:31,600 INFO L225 Difference]: With dead ends: 214467 [2019-12-26 21:39:31,601 INFO L226 Difference]: Without dead ends: 214467 [2019-12-26 21:39:31,601 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-26 21:39:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-26 21:39:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-26 21:39:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-26 21:39:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-26 21:39:50,332 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-26 21:39:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:50,332 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-26 21:39:50,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:39:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-26 21:39:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:39:50,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:50,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:50,343 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-26 21:39:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-26 21:39:50,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:50,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372011675] [2019-12-26 21:39:50,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:50,413 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-26 21:39:50,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372011675] [2019-12-26 21:39:50,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:50,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:50,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646378804] [2019-12-26 21:39:50,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:39:50,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:39:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:39:50,416 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-26 21:39:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:53,563 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-26 21:39:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:39:53,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:39:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:54,272 INFO L225 Difference]: With dead ends: 223450 [2019-12-26 21:39:54,272 INFO L226 Difference]: Without dead ends: 223450 [2019-12-26 21:39:54,272 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-26 21:40:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-26 21:40:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-26 21:40:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-26 21:40:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-26 21:40:12,121 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-26 21:40:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:12,122 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-26 21:40:12,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:40:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-26 21:40:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 21:40:12,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:12,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:40:12,135 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-26 21:40:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:12,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-26 21:40:12,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:12,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755065617] [2019-12-26 21:40:12,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:12,214 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-26 21:40:12,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755065617] [2019-12-26 21:40:12,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:12,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:40:12,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662268109] [2019-12-26 21:40:12,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:12,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:12,217 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-26 21:40:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:14,424 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-26 21:40:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:14,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 21:40:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:14,949 INFO L225 Difference]: With dead ends: 182256 [2019-12-26 21:40:14,949 INFO L226 Difference]: Without dead ends: 182256 [2019-12-26 21:40:14,949 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-26 21:40:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-26 21:40:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-26 21:40:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-26 21:40:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-26 21:40:29,500 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-26 21:40:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:29,500 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-26 21:40:29,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-26 21:40:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:40:29,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:29,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:40:29,515 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-26 21:40:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-26 21:40:29,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:29,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583018037] [2019-12-26 21:40:29,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:29,599 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-26 21:40:29,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583018037] [2019-12-26 21:40:29,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:29,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:40:29,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134383867] [2019-12-26 21:40:29,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:29,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:29,601 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-26 21:40:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:35,459 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-26 21:40:35,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:35,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 21:40:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:35,939 INFO L225 Difference]: With dead ends: 171684 [2019-12-26 21:40:35,939 INFO L226 Difference]: Without dead ends: 171684 [2019-12-26 21:40:35,939 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-26 21:40:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-26 21:40:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-26 21:40:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-26 21:40:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-26 21:40:47,712 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-26 21:40:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:47,713 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-26 21:40:47,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-26 21:40:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:40:47,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:47,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:40:47,725 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-26 21:40:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-26 21:40:47,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:47,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599327330] [2019-12-26 21:40:47,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:47,804 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-26 21:40:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599327330] [2019-12-26 21:40:47,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:47,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:47,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723874665] [2019-12-26 21:40:47,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:40:47,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:40:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:40:47,807 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 4 states. [2019-12-26 21:40:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:47,976 INFO L93 Difference]: Finished difference Result 43415 states and 148945 transitions. [2019-12-26 21:40:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:40:47,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 21:40:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:48,034 INFO L225 Difference]: With dead ends: 43415 [2019-12-26 21:40:48,034 INFO L226 Difference]: Without dead ends: 33284 [2019-12-26 21:40:48,034 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-26 21:40:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33284 states. [2019-12-26 21:40:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33284 to 33284. [2019-12-26 21:40:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33284 states. [2019-12-26 21:40:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33284 states to 33284 states and 107536 transitions. [2019-12-26 21:40:53,258 INFO L78 Accepts]: Start accepts. Automaton has 33284 states and 107536 transitions. Word has length 19 [2019-12-26 21:40:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 33284 states and 107536 transitions. [2019-12-26 21:40:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:40:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 33284 states and 107536 transitions. [2019-12-26 21:40:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:40:53,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:53,264 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-26 21:40:53,264 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-26 21:40:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-26 21:40:53,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:53,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345437310] [2019-12-26 21:40:53,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:53,391 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-26 21:40:53,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345437310] [2019-12-26 21:40:53,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:53,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:53,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538388661] [2019-12-26 21:40:53,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:40:53,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:40:53,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:40:53,392 INFO L87 Difference]: Start difference. First operand 33284 states and 107536 transitions. Second operand 5 states. [2019-12-26 21:40:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:53,976 INFO L93 Difference]: Finished difference Result 51113 states and 162480 transitions. [2019-12-26 21:40:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:40:53,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:40:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:54,053 INFO L225 Difference]: With dead ends: 51113 [2019-12-26 21:40:54,053 INFO L226 Difference]: Without dead ends: 51057 [2019-12-26 21:40:54,053 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-26 21:40:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51057 states. [2019-12-26 21:40:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51057 to 34974. [2019-12-26 21:40:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34974 states. [2019-12-26 21:40:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34974 states to 34974 states and 113053 transitions. [2019-12-26 21:40:54,704 INFO L78 Accepts]: Start accepts. Automaton has 34974 states and 113053 transitions. Word has length 22 [2019-12-26 21:40:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:54,704 INFO L462 AbstractCegarLoop]: Abstraction has 34974 states and 113053 transitions. [2019-12-26 21:40:54,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:40:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34974 states and 113053 transitions. [2019-12-26 21:40:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:40:54,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:54,710 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-26 21:40:54,711 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-26 21:40:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-26 21:40:54,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:54,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053678845] [2019-12-26 21:40:54,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:54,787 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-26 21:40:54,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053678845] [2019-12-26 21:40:54,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:54,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:54,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731175701] [2019-12-26 21:40:54,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:40:54,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:40:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:40:54,789 INFO L87 Difference]: Start difference. First operand 34974 states and 113053 transitions. Second operand 5 states. [2019-12-26 21:40:55,248 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-26 21:40:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:55,815 INFO L93 Difference]: Finished difference Result 52028 states and 165097 transitions. [2019-12-26 21:40:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:40:55,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:40:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:55,895 INFO L225 Difference]: With dead ends: 52028 [2019-12-26 21:40:55,895 INFO L226 Difference]: Without dead ends: 51972 [2019-12-26 21:40:55,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:40:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51972 states. [2019-12-26 21:40:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51972 to 32731. [2019-12-26 21:40:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32731 states. [2019-12-26 21:40:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32731 states to 32731 states and 105533 transitions. [2019-12-26 21:40:56,533 INFO L78 Accepts]: Start accepts. Automaton has 32731 states and 105533 transitions. Word has length 22 [2019-12-26 21:40:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:56,533 INFO L462 AbstractCegarLoop]: Abstraction has 32731 states and 105533 transitions. [2019-12-26 21:40:56,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:40:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32731 states and 105533 transitions. [2019-12-26 21:40:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:40:56,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:56,542 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-26 21:40:56,543 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-26 21:40:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-26 21:40:56,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:56,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113274436] [2019-12-26 21:40:56,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:56,622 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-26 21:40:56,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113274436] [2019-12-26 21:40:56,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:56,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:40:56,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718092585] [2019-12-26 21:40:56,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:40:56,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:40:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:40:56,626 INFO L87 Difference]: Start difference. First operand 32731 states and 105533 transitions. Second operand 5 states. [2019-12-26 21:40:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:56,715 INFO L93 Difference]: Finished difference Result 14600 states and 45354 transitions. [2019-12-26 21:40:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:40:56,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 21:40:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:56,742 INFO L225 Difference]: With dead ends: 14600 [2019-12-26 21:40:56,742 INFO L226 Difference]: Without dead ends: 12861 [2019-12-26 21:40:56,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:40:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-26 21:40:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12797. [2019-12-26 21:40:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12797 states. [2019-12-26 21:40:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12797 states to 12797 states and 39664 transitions. [2019-12-26 21:40:56,956 INFO L78 Accepts]: Start accepts. Automaton has 12797 states and 39664 transitions. Word has length 25 [2019-12-26 21:40:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:56,956 INFO L462 AbstractCegarLoop]: Abstraction has 12797 states and 39664 transitions. [2019-12-26 21:40:56,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:40:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12797 states and 39664 transitions. [2019-12-26 21:40:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:40:56,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:56,966 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-26 21:40:56,966 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-26 21:40:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-26 21:40:56,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:56,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948802953] [2019-12-26 21:40:56,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:56,997 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-26 21:40:56,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948802953] [2019-12-26 21:40:56,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:56,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:56,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328006226] [2019-12-26 21:40:56,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:56,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:56,999 INFO L87 Difference]: Start difference. First operand 12797 states and 39664 transitions. Second operand 3 states. [2019-12-26 21:40:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:57,108 INFO L93 Difference]: Finished difference Result 19381 states and 59631 transitions. [2019-12-26 21:40:57,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:57,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:40:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:57,356 INFO L225 Difference]: With dead ends: 19381 [2019-12-26 21:40:57,356 INFO L226 Difference]: Without dead ends: 19381 [2019-12-26 21:40:57,357 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-26 21:40:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-12-26 21:40:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 15031. [2019-12-26 21:40:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-26 21:40:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 46790 transitions. [2019-12-26 21:40:57,608 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 46790 transitions. Word has length 27 [2019-12-26 21:40:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:57,608 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 46790 transitions. [2019-12-26 21:40:57,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 46790 transitions. [2019-12-26 21:40:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:40:57,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:57,620 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-26 21:40:57,620 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-26 21:40:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-26 21:40:57,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:57,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875658858] [2019-12-26 21:40:57,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:40:57,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875658858] [2019-12-26 21:40:57,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:57,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:57,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981088665] [2019-12-26 21:40:57,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:40:57,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:40:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:40:57,658 INFO L87 Difference]: Start difference. First operand 15031 states and 46790 transitions. Second operand 3 states. [2019-12-26 21:40:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:57,768 INFO L93 Difference]: Finished difference Result 19381 states and 58113 transitions. [2019-12-26 21:40:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:40:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:40:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:57,808 INFO L225 Difference]: With dead ends: 19381 [2019-12-26 21:40:57,809 INFO L226 Difference]: Without dead ends: 19381 [2019-12-26 21:40:57,809 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-26 21:40:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-12-26 21:40:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 15031. [2019-12-26 21:40:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15031 states. [2019-12-26 21:40:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 45272 transitions. [2019-12-26 21:40:58,241 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 45272 transitions. Word has length 27 [2019-12-26 21:40:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:58,242 INFO L462 AbstractCegarLoop]: Abstraction has 15031 states and 45272 transitions. [2019-12-26 21:40:58,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:40:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 45272 transitions. [2019-12-26 21:40:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:40:58,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:58,263 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-26 21:40:58,263 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-26 21:40:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-26 21:40:58,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:58,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377533086] [2019-12-26 21:40:58,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:58,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-26 21:40:58,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377533086] [2019-12-26 21:40:58,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:58,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:58,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300524344] [2019-12-26 21:40:58,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:40:58,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:40:58,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:40:58,353 INFO L87 Difference]: Start difference. First operand 15031 states and 45272 transitions. Second operand 5 states. [2019-12-26 21:40:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:58,707 INFO L93 Difference]: Finished difference Result 18811 states and 55759 transitions. [2019-12-26 21:40:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:40:58,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:40:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:58,735 INFO L225 Difference]: With dead ends: 18811 [2019-12-26 21:40:58,738 INFO L226 Difference]: Without dead ends: 18656 [2019-12-26 21:40:58,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:40:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18656 states. [2019-12-26 21:40:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18656 to 16026. [2019-12-26 21:40:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16026 states. [2019-12-26 21:40:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16026 states to 16026 states and 48226 transitions. [2019-12-26 21:40:58,982 INFO L78 Accepts]: Start accepts. Automaton has 16026 states and 48226 transitions. Word has length 27 [2019-12-26 21:40:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:58,982 INFO L462 AbstractCegarLoop]: Abstraction has 16026 states and 48226 transitions. [2019-12-26 21:40:58,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:40:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 16026 states and 48226 transitions. [2019-12-26 21:40:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:40:58,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:58,995 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-26 21:40:58,995 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-26 21:40:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-26 21:40:58,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:58,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962375825] [2019-12-26 21:40:58,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:59,097 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-26 21:40:59,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962375825] [2019-12-26 21:40:59,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:59,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:40:59,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750100412] [2019-12-26 21:40:59,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:40:59,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:59,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:40:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:40:59,100 INFO L87 Difference]: Start difference. First operand 16026 states and 48226 transitions. Second operand 6 states. [2019-12-26 21:40:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:40:59,230 INFO L93 Difference]: Finished difference Result 20253 states and 60205 transitions. [2019-12-26 21:40:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:40:59,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 21:40:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:40:59,258 INFO L225 Difference]: With dead ends: 20253 [2019-12-26 21:40:59,258 INFO L226 Difference]: Without dead ends: 20253 [2019-12-26 21:40:59,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:40:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2019-12-26 21:40:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 16366. [2019-12-26 21:40:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16366 states. [2019-12-26 21:40:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16366 states to 16366 states and 49150 transitions. [2019-12-26 21:40:59,625 INFO L78 Accepts]: Start accepts. Automaton has 16366 states and 49150 transitions. Word has length 28 [2019-12-26 21:40:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:40:59,625 INFO L462 AbstractCegarLoop]: Abstraction has 16366 states and 49150 transitions. [2019-12-26 21:40:59,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:40:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 16366 states and 49150 transitions. [2019-12-26 21:40:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 21:40:59,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:40:59,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:40:59,639 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-26 21:40:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:40:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-26 21:40:59,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:40:59,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996004507] [2019-12-26 21:40:59,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:40:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:40:59,709 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-26 21:40:59,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996004507] [2019-12-26 21:40:59,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:40:59,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:40:59,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188128225] [2019-12-26 21:40:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:40:59,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:40:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:40:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:40:59,711 INFO L87 Difference]: Start difference. First operand 16366 states and 49150 transitions. Second operand 5 states. [2019-12-26 21:41:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:00,073 INFO L93 Difference]: Finished difference Result 19702 states and 58034 transitions. [2019-12-26 21:41:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:41:00,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 21:41:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:00,102 INFO L225 Difference]: With dead ends: 19702 [2019-12-26 21:41:00,102 INFO L226 Difference]: Without dead ends: 19540 [2019-12-26 21:41:00,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:41:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19540 states. [2019-12-26 21:41:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19540 to 16090. [2019-12-26 21:41:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16090 states. [2019-12-26 21:41:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16090 states to 16090 states and 48263 transitions. [2019-12-26 21:41:00,364 INFO L78 Accepts]: Start accepts. Automaton has 16090 states and 48263 transitions. Word has length 29 [2019-12-26 21:41:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:00,364 INFO L462 AbstractCegarLoop]: Abstraction has 16090 states and 48263 transitions. [2019-12-26 21:41:00,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:41:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16090 states and 48263 transitions. [2019-12-26 21:41:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:41:00,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:00,379 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-26 21:41:00,379 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-26 21:41:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-26 21:41:00,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:00,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675211859] [2019-12-26 21:41:00,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:41:00,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675211859] [2019-12-26 21:41:00,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:00,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:41:00,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018235849] [2019-12-26 21:41:00,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:41:00,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:41:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:41:00,491 INFO L87 Difference]: Start difference. First operand 16090 states and 48263 transitions. Second operand 6 states. [2019-12-26 21:41:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:01,168 INFO L93 Difference]: Finished difference Result 21301 states and 62588 transitions. [2019-12-26 21:41:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:41:01,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 21:41:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:01,196 INFO L225 Difference]: With dead ends: 21301 [2019-12-26 21:41:01,196 INFO L226 Difference]: Without dead ends: 20980 [2019-12-26 21:41:01,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:41:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20980 states. [2019-12-26 21:41:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20980 to 16150. [2019-12-26 21:41:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-26 21:41:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 48426 transitions. [2019-12-26 21:41:01,456 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 48426 transitions. Word has length 33 [2019-12-26 21:41:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:01,456 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 48426 transitions. [2019-12-26 21:41:01,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:41:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 48426 transitions. [2019-12-26 21:41:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 21:41:01,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:01,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:41:01,471 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-26 21:41:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-26 21:41:01,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:01,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542096483] [2019-12-26 21:41:01,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:01,552 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-26 21:41:01,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542096483] [2019-12-26 21:41:01,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:01,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:41:01,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243633715] [2019-12-26 21:41:01,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:41:01,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:41:01,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:41:01,557 INFO L87 Difference]: Start difference. First operand 16150 states and 48426 transitions. Second operand 6 states. [2019-12-26 21:41:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:02,163 INFO L93 Difference]: Finished difference Result 20328 states and 59884 transitions. [2019-12-26 21:41:02,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:41:02,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-26 21:41:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:02,198 INFO L225 Difference]: With dead ends: 20328 [2019-12-26 21:41:02,198 INFO L226 Difference]: Without dead ends: 19953 [2019-12-26 21:41:02,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:41:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-26 21:41:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 15004. [2019-12-26 21:41:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15004 states. [2019-12-26 21:41:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 45066 transitions. [2019-12-26 21:41:02,525 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 45066 transitions. Word has length 35 [2019-12-26 21:41:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:02,525 INFO L462 AbstractCegarLoop]: Abstraction has 15004 states and 45066 transitions. [2019-12-26 21:41:02,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:41:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 45066 transitions. [2019-12-26 21:41:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:41:02,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:02,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:41:02,543 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-26 21:41:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-26 21:41:02,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:02,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085616743] [2019-12-26 21:41:02,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:02,612 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-26 21:41:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085616743] [2019-12-26 21:41:02,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:41:02,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729253287] [2019-12-26 21:41:02,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:41:02,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:41:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:41:02,614 INFO L87 Difference]: Start difference. First operand 15004 states and 45066 transitions. Second operand 5 states. [2019-12-26 21:41:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:03,190 INFO L93 Difference]: Finished difference Result 24603 states and 72694 transitions. [2019-12-26 21:41:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:41:03,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:41:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:03,222 INFO L225 Difference]: With dead ends: 24603 [2019-12-26 21:41:03,222 INFO L226 Difference]: Without dead ends: 24603 [2019-12-26 21:41:03,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:41:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24603 states. [2019-12-26 21:41:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24603 to 18105. [2019-12-26 21:41:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18105 states. [2019-12-26 21:41:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18105 states to 18105 states and 54450 transitions. [2019-12-26 21:41:03,524 INFO L78 Accepts]: Start accepts. Automaton has 18105 states and 54450 transitions. Word has length 41 [2019-12-26 21:41:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:03,525 INFO L462 AbstractCegarLoop]: Abstraction has 18105 states and 54450 transitions. [2019-12-26 21:41:03,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:41:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18105 states and 54450 transitions. [2019-12-26 21:41:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:41:03,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:03,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:41:03,549 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-26 21:41:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-26 21:41:03,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:03,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704610408] [2019-12-26 21:41:03,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:41:03,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704610408] [2019-12-26 21:41:03,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:03,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:41:03,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252611521] [2019-12-26 21:41:03,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:41:03,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:41:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:41:03,640 INFO L87 Difference]: Start difference. First operand 18105 states and 54450 transitions. Second operand 6 states. [2019-12-26 21:41:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:03,752 INFO L93 Difference]: Finished difference Result 16993 states and 52027 transitions. [2019-12-26 21:41:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:41:03,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 21:41:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:03,777 INFO L225 Difference]: With dead ends: 16993 [2019-12-26 21:41:03,777 INFO L226 Difference]: Without dead ends: 16868 [2019-12-26 21:41:03,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:41:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2019-12-26 21:41:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 16868. [2019-12-26 21:41:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16868 states. [2019-12-26 21:41:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16868 states to 16868 states and 51763 transitions. [2019-12-26 21:41:04,018 INFO L78 Accepts]: Start accepts. Automaton has 16868 states and 51763 transitions. Word has length 41 [2019-12-26 21:41:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:04,019 INFO L462 AbstractCegarLoop]: Abstraction has 16868 states and 51763 transitions. [2019-12-26 21:41:04,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:41:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 16868 states and 51763 transitions. [2019-12-26 21:41:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:04,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:04,036 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-26 21:41:04,036 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-26 21:41:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-26 21:41:04,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:04,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042724430] [2019-12-26 21:41:04,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:04,129 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-26 21:41:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042724430] [2019-12-26 21:41:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:04,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:41:04,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102494187] [2019-12-26 21:41:04,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:41:04,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:41:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:41:04,131 INFO L87 Difference]: Start difference. First operand 16868 states and 51763 transitions. Second operand 7 states. [2019-12-26 21:41:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:04,628 INFO L93 Difference]: Finished difference Result 48420 states and 146954 transitions. [2019-12-26 21:41:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:41:04,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:41:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:04,676 INFO L225 Difference]: With dead ends: 48420 [2019-12-26 21:41:04,676 INFO L226 Difference]: Without dead ends: 35498 [2019-12-26 21:41:04,676 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-26 21:41:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35498 states. [2019-12-26 21:41:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35498 to 19884. [2019-12-26 21:41:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19884 states. [2019-12-26 21:41:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 60700 transitions. [2019-12-26 21:41:05,081 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 60700 transitions. Word has length 65 [2019-12-26 21:41:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:05,081 INFO L462 AbstractCegarLoop]: Abstraction has 19884 states and 60700 transitions. [2019-12-26 21:41:05,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:41:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 60700 transitions. [2019-12-26 21:41:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:05,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:05,102 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-26 21:41:05,102 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-26 21:41:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 292633507, now seen corresponding path program 2 times [2019-12-26 21:41:05,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:05,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881921517] [2019-12-26 21:41:05,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:05,210 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-26 21:41:05,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881921517] [2019-12-26 21:41:05,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:05,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:41:05,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162377371] [2019-12-26 21:41:05,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:41:05,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:41:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:41:05,212 INFO L87 Difference]: Start difference. First operand 19884 states and 60700 transitions. Second operand 8 states. [2019-12-26 21:41:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:06,401 INFO L93 Difference]: Finished difference Result 73574 states and 221583 transitions. [2019-12-26 21:41:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:41:06,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:41:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:06,477 INFO L225 Difference]: With dead ends: 73574 [2019-12-26 21:41:06,477 INFO L226 Difference]: Without dead ends: 53643 [2019-12-26 21:41:06,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:41:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53643 states. [2019-12-26 21:41:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53643 to 24116. [2019-12-26 21:41:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24116 states. [2019-12-26 21:41:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24116 states to 24116 states and 73542 transitions. [2019-12-26 21:41:07,241 INFO L78 Accepts]: Start accepts. Automaton has 24116 states and 73542 transitions. Word has length 65 [2019-12-26 21:41:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 24116 states and 73542 transitions. [2019-12-26 21:41:07,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:41:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24116 states and 73542 transitions. [2019-12-26 21:41:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:07,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:07,264 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-26 21:41:07,264 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-26 21:41:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 45765331, now seen corresponding path program 3 times [2019-12-26 21:41:07,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:07,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403557146] [2019-12-26 21:41:07,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:07,400 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-26 21:41:07,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403557146] [2019-12-26 21:41:07,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:07,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:41:07,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590756752] [2019-12-26 21:41:07,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:41:07,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:07,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:41:07,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:41:07,402 INFO L87 Difference]: Start difference. First operand 24116 states and 73542 transitions. Second operand 9 states. [2019-12-26 21:41:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:08,867 INFO L93 Difference]: Finished difference Result 89263 states and 266477 transitions. [2019-12-26 21:41:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:41:08,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:41:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:08,984 INFO L225 Difference]: With dead ends: 89263 [2019-12-26 21:41:08,984 INFO L226 Difference]: Without dead ends: 85572 [2019-12-26 21:41:08,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:41:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85572 states. [2019-12-26 21:41:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85572 to 24556. [2019-12-26 21:41:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24556 states. [2019-12-26 21:41:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24556 states to 24556 states and 74877 transitions. [2019-12-26 21:41:10,056 INFO L78 Accepts]: Start accepts. Automaton has 24556 states and 74877 transitions. Word has length 65 [2019-12-26 21:41:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:10,057 INFO L462 AbstractCegarLoop]: Abstraction has 24556 states and 74877 transitions. [2019-12-26 21:41:10,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:41:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 24556 states and 74877 transitions. [2019-12-26 21:41:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:10,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:10,082 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-26 21:41:10,082 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-26 21:41:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1660891443, now seen corresponding path program 4 times [2019-12-26 21:41:10,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:10,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735421870] [2019-12-26 21:41:10,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:10,205 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-26 21:41:10,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735421870] [2019-12-26 21:41:10,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:10,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:41:10,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111836780] [2019-12-26 21:41:10,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:41:10,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:41:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:41:10,207 INFO L87 Difference]: Start difference. First operand 24556 states and 74877 transitions. Second operand 9 states. [2019-12-26 21:41:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:11,526 INFO L93 Difference]: Finished difference Result 69954 states and 209532 transitions. [2019-12-26 21:41:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:41:11,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:41:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:11,633 INFO L225 Difference]: With dead ends: 69954 [2019-12-26 21:41:11,634 INFO L226 Difference]: Without dead ends: 67627 [2019-12-26 21:41:11,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:41:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67627 states. [2019-12-26 21:41:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67627 to 24332. [2019-12-26 21:41:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24332 states. [2019-12-26 21:41:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24332 states to 24332 states and 74381 transitions. [2019-12-26 21:41:12,652 INFO L78 Accepts]: Start accepts. Automaton has 24332 states and 74381 transitions. Word has length 65 [2019-12-26 21:41:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:12,652 INFO L462 AbstractCegarLoop]: Abstraction has 24332 states and 74381 transitions. [2019-12-26 21:41:12,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:41:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 24332 states and 74381 transitions. [2019-12-26 21:41:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:12,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:12,687 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-26 21:41:12,687 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-26 21:41:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 5 times [2019-12-26 21:41:12,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:12,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157014678] [2019-12-26 21:41:12,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:12,754 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-26 21:41:12,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157014678] [2019-12-26 21:41:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:41:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189889734] [2019-12-26 21:41:12,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:41:12,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:41:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:41:12,756 INFO L87 Difference]: Start difference. First operand 24332 states and 74381 transitions. Second operand 7 states. [2019-12-26 21:41:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:13,149 INFO L93 Difference]: Finished difference Result 49829 states and 149744 transitions. [2019-12-26 21:41:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:41:13,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:41:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:13,209 INFO L225 Difference]: With dead ends: 49829 [2019-12-26 21:41:13,209 INFO L226 Difference]: Without dead ends: 42018 [2019-12-26 21:41:13,210 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-26 21:41:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42018 states. [2019-12-26 21:41:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42018 to 24668. [2019-12-26 21:41:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24668 states. [2019-12-26 21:41:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24668 states to 24668 states and 75363 transitions. [2019-12-26 21:41:13,748 INFO L78 Accepts]: Start accepts. Automaton has 24668 states and 75363 transitions. Word has length 65 [2019-12-26 21:41:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:13,748 INFO L462 AbstractCegarLoop]: Abstraction has 24668 states and 75363 transitions. [2019-12-26 21:41:13,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:41:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24668 states and 75363 transitions. [2019-12-26 21:41:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:41:13,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:13,780 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-26 21:41:13,780 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-26 21:41:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 6 times [2019-12-26 21:41:13,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:13,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379752562] [2019-12-26 21:41:13,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:13,835 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-26 21:41:13,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379752562] [2019-12-26 21:41:13,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:13,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:41:13,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669360343] [2019-12-26 21:41:13,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:41:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:41:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:41:13,837 INFO L87 Difference]: Start difference. First operand 24668 states and 75363 transitions. Second operand 3 states. [2019-12-26 21:41:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:14,011 INFO L93 Difference]: Finished difference Result 27344 states and 83338 transitions. [2019-12-26 21:41:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:41:14,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:41:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:14,056 INFO L225 Difference]: With dead ends: 27344 [2019-12-26 21:41:14,056 INFO L226 Difference]: Without dead ends: 27344 [2019-12-26 21:41:14,056 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-26 21:41:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27344 states. [2019-12-26 21:41:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27344 to 23231. [2019-12-26 21:41:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23231 states. [2019-12-26 21:41:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23231 states to 23231 states and 71446 transitions. [2019-12-26 21:41:14,659 INFO L78 Accepts]: Start accepts. Automaton has 23231 states and 71446 transitions. Word has length 65 [2019-12-26 21:41:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:14,660 INFO L462 AbstractCegarLoop]: Abstraction has 23231 states and 71446 transitions. [2019-12-26 21:41:14,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:41:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23231 states and 71446 transitions. [2019-12-26 21:41:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:41:14,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:14,685 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-26 21:41:14,685 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-26 21:41:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash -243481851, now seen corresponding path program 1 times [2019-12-26 21:41:14,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:14,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014903668] [2019-12-26 21:41:14,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:14,762 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-26 21:41:14,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014903668] [2019-12-26 21:41:14,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:14,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:41:14,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279477787] [2019-12-26 21:41:14,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:41:14,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:41:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:41:14,764 INFO L87 Difference]: Start difference. First operand 23231 states and 71446 transitions. Second operand 6 states. [2019-12-26 21:41:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:15,614 INFO L93 Difference]: Finished difference Result 30013 states and 90420 transitions. [2019-12-26 21:41:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:41:15,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 21:41:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:15,657 INFO L225 Difference]: With dead ends: 30013 [2019-12-26 21:41:15,657 INFO L226 Difference]: Without dead ends: 30013 [2019-12-26 21:41:15,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:41:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-26 21:41:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 23147. [2019-12-26 21:41:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23147 states. [2019-12-26 21:41:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23147 states to 23147 states and 71178 transitions. [2019-12-26 21:41:16,052 INFO L78 Accepts]: Start accepts. Automaton has 23147 states and 71178 transitions. Word has length 66 [2019-12-26 21:41:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:16,053 INFO L462 AbstractCegarLoop]: Abstraction has 23147 states and 71178 transitions. [2019-12-26 21:41:16,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:41:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 23147 states and 71178 transitions. [2019-12-26 21:41:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:41:16,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:16,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, 1, 1, 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-26 21:41:16,080 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-26 21:41:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash -44744943, now seen corresponding path program 2 times [2019-12-26 21:41:16,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:16,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859584703] [2019-12-26 21:41:16,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:16,170 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-26 21:41:16,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859584703] [2019-12-26 21:41:16,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:16,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:41:16,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28986268] [2019-12-26 21:41:16,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:41:16,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:41:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:41:16,172 INFO L87 Difference]: Start difference. First operand 23147 states and 71178 transitions. Second operand 7 states. [2019-12-26 21:41:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:17,423 INFO L93 Difference]: Finished difference Result 30616 states and 92074 transitions. [2019-12-26 21:41:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:41:17,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 21:41:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:17,465 INFO L225 Difference]: With dead ends: 30616 [2019-12-26 21:41:17,465 INFO L226 Difference]: Without dead ends: 30616 [2019-12-26 21:41:17,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:41:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30616 states. [2019-12-26 21:41:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30616 to 22749. [2019-12-26 21:41:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22749 states. [2019-12-26 21:41:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22749 states to 22749 states and 69979 transitions. [2019-12-26 21:41:17,996 INFO L78 Accepts]: Start accepts. Automaton has 22749 states and 69979 transitions. Word has length 66 [2019-12-26 21:41:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:17,996 INFO L462 AbstractCegarLoop]: Abstraction has 22749 states and 69979 transitions. [2019-12-26 21:41:17,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:41:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 22749 states and 69979 transitions. [2019-12-26 21:41:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:41:18,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:18,018 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-26 21:41:18,018 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-26 21:41:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1480053167, now seen corresponding path program 3 times [2019-12-26 21:41:18,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:18,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84049109] [2019-12-26 21:41:18,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:18,083 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-26 21:41:18,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84049109] [2019-12-26 21:41:18,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:18,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:41:18,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898140033] [2019-12-26 21:41:18,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:41:18,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:41:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:41:18,085 INFO L87 Difference]: Start difference. First operand 22749 states and 69979 transitions. Second operand 3 states. [2019-12-26 21:41:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:18,158 INFO L93 Difference]: Finished difference Result 17337 states and 52737 transitions. [2019-12-26 21:41:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:41:18,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:41:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:18,188 INFO L225 Difference]: With dead ends: 17337 [2019-12-26 21:41:18,189 INFO L226 Difference]: Without dead ends: 17337 [2019-12-26 21:41:18,190 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-26 21:41:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17337 states. [2019-12-26 21:41:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17337 to 16045. [2019-12-26 21:41:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16045 states. [2019-12-26 21:41:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16045 states to 16045 states and 48799 transitions. [2019-12-26 21:41:18,444 INFO L78 Accepts]: Start accepts. Automaton has 16045 states and 48799 transitions. Word has length 66 [2019-12-26 21:41:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:41:18,444 INFO L462 AbstractCegarLoop]: Abstraction has 16045 states and 48799 transitions. [2019-12-26 21:41:18,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:41:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16045 states and 48799 transitions. [2019-12-26 21:41:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:41:18,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:18,461 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-26 21:41:18,461 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-26 21:41:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-26 21:41:18,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:18,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615973506] [2019-12-26 21:41:18,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:41:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:41:18,578 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:41:18,579 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:41:18,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t409~0.base_44| 4)) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44| 1)) (= v_~main$tmp_guard0~0_44 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44|) |v_ULTIMATE.start_main_~#t409~0.offset_30| 0)) |v_#memory_int_21|) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t409~0.base_44|) (= (select .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44|) 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t409~0.offset_30|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_30|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ULTIMATE.start_main_~#t409~0.base=|v_ULTIMATE.start_main_~#t409~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t409~0.offset=|v_ULTIMATE.start_main_~#t409~0.offset_30|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_19|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t410~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t410~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t409~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t409~0.offset, ULTIMATE.start_main_~#t411~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:41:18,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff0_thd0~0_In-1783052698 ~z$r_buff1_thd0~0_Out-1783052698) (= ~z$r_buff1_thd2~0_Out-1783052698 ~z$r_buff0_thd2~0_In-1783052698) (= ~z$r_buff0_thd3~0_In-1783052698 ~z$r_buff1_thd3~0_Out-1783052698) (= 1 ~z$r_buff0_thd1~0_Out-1783052698) (= ~z$r_buff1_thd1~0_Out-1783052698 ~z$r_buff0_thd1~0_In-1783052698) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1783052698)) (= ~x~0_In-1783052698 ~__unbuffered_p0_EAX~0_Out-1783052698)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1783052698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1783052698, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1783052698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1783052698, ~x~0=~x~0_In-1783052698, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1783052698} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1783052698, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1783052698, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1783052698, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1783052698, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1783052698, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1783052698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1783052698, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1783052698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1783052698, ~x~0=~x~0_In-1783052698, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1783052698} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:41:18,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13|) 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t410~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t410~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t410~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13|) |v_ULTIMATE.start_main_~#t410~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t410~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_11|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t410~0.offset, ULTIMATE.start_main_~#t410~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:41:18,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In985517917 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out985517917| |P1Thread1of1ForFork2_#t~ite10_Out985517917|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In985517917 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out985517917| ~z~0_In985517917) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out985517917| ~z$w_buff1~0_In985517917) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In985517917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985517917, ~z$w_buff1~0=~z$w_buff1~0_In985517917, ~z~0=~z~0_In985517917} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out985517917|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In985517917, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out985517917|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985517917, ~z$w_buff1~0=~z$w_buff1~0_In985517917, ~z~0=~z~0_In985517917} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:41:18,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1653495013 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1653495013 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1653495013| ~z$w_buff0_used~0_In1653495013)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1653495013|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1653495013, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1653495013} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1653495013, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1653495013|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1653495013} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:41:18,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In-1949103328 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1949103328 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1949103328 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1949103328 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1949103328|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1949103328 |P1Thread1of1ForFork2_#t~ite12_Out-1949103328|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949103328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1949103328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949103328, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1949103328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949103328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1949103328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949103328, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1949103328|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1949103328} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:41:18,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t411~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t411~0.base_10|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t411~0.base_10| 4) |v_#length_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10|) |v_ULTIMATE.start_main_~#t411~0.offset_9| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t411~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t411~0.offset, #length] because there is no mapped edge [2019-12-26 21:41:18,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1456301977 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1456301977| |P2Thread1of1ForFork0_#t~ite20_Out-1456301977|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1456301977| ~z$w_buff0~0_In-1456301977) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1456301977 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1456301977 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1456301977 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-1456301977 256)) .cse0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1456301977| ~z$w_buff0~0_In-1456301977) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In-1456301977| |P2Thread1of1ForFork0_#t~ite20_Out-1456301977|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1456301977, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1456301977, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1456301977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1456301977, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1456301977, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1456301977|, ~weak$$choice2~0=~weak$$choice2~0_In-1456301977} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1456301977|, ~z$w_buff0~0=~z$w_buff0~0_In-1456301977, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1456301977, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1456301977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1456301977, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1456301977, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1456301977|, ~weak$$choice2~0=~weak$$choice2~0_In-1456301977} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:41:18,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2123046613 256)))) (or (and (= ~z$w_buff1~0_In-2123046613 |P2Thread1of1ForFork0_#t~ite23_Out-2123046613|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2123046613 256)))) (or (= (mod ~z$w_buff0_used~0_In-2123046613 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2123046613 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-2123046613 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite24_Out-2123046613| |P2Thread1of1ForFork0_#t~ite23_Out-2123046613|)) (and (= ~z$w_buff1~0_In-2123046613 |P2Thread1of1ForFork0_#t~ite24_Out-2123046613|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-2123046613| |P2Thread1of1ForFork0_#t~ite23_Out-2123046613|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2123046613, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2123046613, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-2123046613|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123046613, ~z$w_buff1~0=~z$w_buff1~0_In-2123046613, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2123046613, ~weak$$choice2~0=~weak$$choice2~0_In-2123046613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2123046613, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-2123046613|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2123046613, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-2123046613|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2123046613, ~z$w_buff1~0=~z$w_buff1~0_In-2123046613, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2123046613, ~weak$$choice2~0=~weak$$choice2~0_In-2123046613} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:41:18,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:41:18,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:41:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In335969312 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In335969312 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In335969312 |P2Thread1of1ForFork0_#t~ite38_Out335969312|)) (and (= ~z$w_buff1~0_In335969312 |P2Thread1of1ForFork0_#t~ite38_Out335969312|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In335969312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335969312, ~z$w_buff1~0=~z$w_buff1~0_In335969312, ~z~0=~z~0_In335969312} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out335969312|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In335969312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335969312, ~z$w_buff1~0=~z$w_buff1~0_In335969312, ~z~0=~z~0_In335969312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:41:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:41:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-773194282 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-773194282 256)))) (or (and (= ~z$w_buff0_used~0_In-773194282 |P2Thread1of1ForFork0_#t~ite40_Out-773194282|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-773194282|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-773194282, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773194282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-773194282, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-773194282|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773194282} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:41:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-670000282 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-670000282 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-670000282|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-670000282 |P1Thread1of1ForFork2_#t~ite13_Out-670000282|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-670000282, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-670000282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-670000282, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-670000282|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-670000282} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:41:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1075332814 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1075332814 256)))) (or (and (= ~z$w_buff0_used~0_In1075332814 |P0Thread1of1ForFork1_#t~ite5_Out1075332814|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1075332814|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1075332814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1075332814} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1075332814|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1075332814, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1075332814} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:41:18,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1762619022 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1762619022 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1762619022 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1762619022 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1762619022| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out1762619022| ~z$w_buff1_used~0_In1762619022)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1762619022, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762619022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1762619022, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1762619022|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762619022} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:41:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-2035653268 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2035653268 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-2035653268 0)) (and (= ~z$r_buff0_thd1~0_Out-2035653268 ~z$r_buff0_thd1~0_In-2035653268) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035653268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2035653268} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035653268, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2035653268|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2035653268} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:41:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In811789828 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In811789828 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In811789828 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In811789828 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out811789828| ~z$r_buff1_thd1~0_In811789828) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out811789828| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In811789828, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In811789828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In811789828, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In811789828} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out811789828|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811789828, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In811789828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In811789828, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In811789828} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:41:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:41:18,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-611402943 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-611402943 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-611402943 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-611402943 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-611402943|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-611402943 |P2Thread1of1ForFork0_#t~ite41_Out-611402943|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-611402943, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-611402943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-611402943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-611402943} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-611402943, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-611402943, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-611402943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-611402943, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-611402943|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:41:18,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In971447835 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In971447835 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out971447835| ~z$r_buff0_thd3~0_In971447835)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out971447835| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In971447835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In971447835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In971447835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In971447835, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out971447835|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:41:18,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2071676464 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2071676464 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2071676464 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In2071676464 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out2071676464| ~z$r_buff1_thd3~0_In2071676464)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out2071676464| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2071676464, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2071676464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071676464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2071676464} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2071676464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2071676464, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2071676464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071676464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2071676464} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:41:18,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:41:18,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In899938650 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In899938650 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In899938650 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In899938650 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out899938650|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In899938650 |P1Thread1of1ForFork2_#t~ite14_Out899938650|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In899938650, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In899938650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In899938650, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In899938650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In899938650, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In899938650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In899938650, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out899938650|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In899938650} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:41:18,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:41:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:41:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1424622380 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1424622380 256)))) (or (and (= ~z~0_In1424622380 |ULTIMATE.start_main_#t~ite47_Out1424622380|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In1424622380 |ULTIMATE.start_main_#t~ite47_Out1424622380|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1424622380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1424622380, ~z$w_buff1~0=~z$w_buff1~0_In1424622380, ~z~0=~z~0_In1424622380} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1424622380, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1424622380|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1424622380, ~z$w_buff1~0=~z$w_buff1~0_In1424622380, ~z~0=~z~0_In1424622380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:41:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-26 21:41:18,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1050655637 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1050655637 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1050655637| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1050655637| ~z$w_buff0_used~0_In-1050655637)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1050655637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050655637} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1050655637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050655637, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1050655637|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:41:18,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In602505607 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In602505607 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In602505607 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In602505607 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In602505607 |ULTIMATE.start_main_#t~ite50_Out602505607|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out602505607|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In602505607, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In602505607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602505607} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out602505607|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In602505607, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In602505607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602505607} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:41:18,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-164426591 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-164426591 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-164426591| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-164426591 |ULTIMATE.start_main_#t~ite51_Out-164426591|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-164426591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-164426591} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-164426591, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-164426591|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-164426591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:41:18,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1164682312 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1164682312 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1164682312 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1164682312 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1164682312|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1164682312 |ULTIMATE.start_main_#t~ite52_Out1164682312|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1164682312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1164682312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1164682312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1164682312} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1164682312|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1164682312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1164682312, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1164682312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1164682312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:41:18,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:41:18,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:41:18 BasicIcfg [2019-12-26 21:41:18,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:41:18,740 INFO L168 Benchmark]: Toolchain (without parser) took 185116.32 ms. Allocated memory was 142.6 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 99.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,741 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.56 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 151.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.71 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 149.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,748 INFO L168 Benchmark]: Boogie Preprocessor took 38.15 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,749 INFO L168 Benchmark]: RCFGBuilder took 1071.75 ms. Allocated memory is still 200.3 MB. Free memory was 146.1 MB in the beginning and 95.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,749 INFO L168 Benchmark]: TraceAbstraction took 183076.05 ms. Allocated memory was 200.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 95.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:41:18,754 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.56 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 151.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.71 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 149.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.15 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1071.75 ms. Allocated memory is still 200.3 MB. Free memory was 146.1 MB in the beginning and 95.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183076.05 ms. Allocated memory was 200.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 95.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 182.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6102 SDtfs, 7961 SDslu, 15006 SDs, 0 SdLazy, 7489 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 71 SyntacticMatches, 13 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 111.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 380394 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1127 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 168175 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...