/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:58:09,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:58:09,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:58:09,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:58:09,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:58:09,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:58:09,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:58:09,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:58:09,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:58:09,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:58:09,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:58:09,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:58:09,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:58:09,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:58:09,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:58:09,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:58:09,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:58:09,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:58:09,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:58:09,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:58:09,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:58:09,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:58:09,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:58:09,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:58:09,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:58:09,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:58:09,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:58:09,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:58:09,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:58:09,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:58:09,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:58:09,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:58:09,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:58:09,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:58:09,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:58:09,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:58:09,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:58:09,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:58:09,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:58:09,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:58:09,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:58:09,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:58:09,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:58:09,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:58:09,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:58:09,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:58:09,551 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:58:09,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:58:09,552 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:58:09,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:58:09,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:58:09,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:58:09,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:58:09,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:58:09,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:58:09,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:58:09,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:58:09,555 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:58:09,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:58:09,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:58:09,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:58:09,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:58:09,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:58:09,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:58:09,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:58:09,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:58:09,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:58:09,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:58:09,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:58:09,557 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:58:09,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:58:09,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:58:09,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:58:09,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:58:09,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:58:09,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:58:09,846 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:58:09,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 07:58:09,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cfb5991/d6effbc21a9841c9bcdee66680291e40/FLAG453a4fe19 [2019-12-27 07:58:10,449 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:58:10,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 07:58:10,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cfb5991/d6effbc21a9841c9bcdee66680291e40/FLAG453a4fe19 [2019-12-27 07:58:10,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cfb5991/d6effbc21a9841c9bcdee66680291e40 [2019-12-27 07:58:10,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:58:10,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:58:10,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:58:10,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:58:10,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:58:10,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:10" (1/1) ... [2019-12-27 07:58:10,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d944e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:10, skipping insertion in model container [2019-12-27 07:58:10,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:10" (1/1) ... [2019-12-27 07:58:10,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:58:10,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:58:11,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:58:11,344 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:58:11,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:58:11,496 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:58:11,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11 WrapperNode [2019-12-27 07:58:11,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:58:11,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:58:11,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:58:11,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:58:11,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:58:11,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:58:11,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:58:11,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:58:11,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... [2019-12-27 07:58:11,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:58:11,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:58:11,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:58:11,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:58:11,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:58:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:58:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:58:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:58:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:58:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:58:11,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:58:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:58:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:58:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:58:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:58:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:58:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:58:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:58:11,676 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:58:12,380 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:58:12,380 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:58:12,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:12 BoogieIcfgContainer [2019-12-27 07:58:12,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:58:12,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:58:12,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:58:12,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:58:12,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:58:10" (1/3) ... [2019-12-27 07:58:12,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dc0a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:12, skipping insertion in model container [2019-12-27 07:58:12,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:11" (2/3) ... [2019-12-27 07:58:12,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dc0a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:12, skipping insertion in model container [2019-12-27 07:58:12,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:12" (3/3) ... [2019-12-27 07:58:12,390 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-27 07:58:12,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:58:12,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:58:12,411 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:58:12,412 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:58:12,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:58:12,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:58:12,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:58:12,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:58:12,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:58:12,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:58:12,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:58:12,575 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:58:12,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:58:12,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:58:12,591 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 07:58:12,593 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:58:12,691 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:58:12,691 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:58:12,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:58:12,730 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 07:58:12,782 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 07:58:12,782 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:58:12,790 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:58:12,810 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:58:12,811 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:58:16,597 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 07:58:16,713 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:58:16,736 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 07:58:16,736 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 07:58:16,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 07:58:28,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 07:58:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 07:58:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:58:28,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:28,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:58:28,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:28,108 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 07:58:28,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:28,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736609964] [2019-12-27 07:58:28,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:58:28,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736609964] [2019-12-27 07:58:28,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:28,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:58:28,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304201471] [2019-12-27 07:58:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:58:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:58:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:58:28,412 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 07:58:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:30,966 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 07:58:30,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:58:30,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:58:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:31,523 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 07:58:31,523 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 07:58:31,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:58:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 07:58:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 07:58:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 07:58:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 07:58:41,314 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 07:58:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:41,314 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 07:58:41,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:58:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 07:58:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:58:41,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:41,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:41,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 07:58:41,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:41,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86908964] [2019-12-27 07:58:41,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:58:41,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86908964] [2019-12-27 07:58:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:41,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:58:41,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506284219] [2019-12-27 07:58:41,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:58:41,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:58:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:58:41,430 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 07:58:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:45,770 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 07:58:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:58:45,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:58:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:46,138 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 07:58:46,138 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 07:58:46,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:58:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 07:58:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 07:58:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 07:58:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 07:58:52,328 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 07:58:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 07:58:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:58:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 07:58:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:58:52,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:52,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:52,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 07:58:52,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:52,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816564747] [2019-12-27 07:58:52,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:58:52,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816564747] [2019-12-27 07:58:52,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:52,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:58:52,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815061913] [2019-12-27 07:58:52,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:58:52,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:52,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:58:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:58:52,398 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 07:58:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:52,501 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 07:58:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:58:52,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:58:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:52,606 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 07:58:52,607 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 07:58:52,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:58:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 07:58:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 07:58:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 07:58:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 07:58:56,773 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 07:58:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:56,774 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 07:58:56,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:58:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 07:58:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:58:56,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:56,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:56,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 07:58:56,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:56,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219350613] [2019-12-27 07:58:56,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:58:56,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219350613] [2019-12-27 07:58:56,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:58:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659644673] [2019-12-27 07:58:56,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:58:56,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:58:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:58:56,867 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 07:58:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:57,361 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 07:58:57,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:58:57,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 07:58:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:57,467 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 07:58:57,467 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 07:58:57,467 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-27 07:58:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 07:58:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 07:58:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 07:58:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 07:58:58,182 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 07:58:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:58:58,182 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 07:58:58,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:58:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 07:58:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:58:58,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:58:58,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:58:58,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:58:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:58:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 07:58:58,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:58:58,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63932118] [2019-12-27 07:58:58,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:58:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:58:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:58:58,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63932118] [2019-12-27 07:58:58,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:58:58,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:58:58,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363470060] [2019-12-27 07:58:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:58:58,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:58:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:58:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:58:58,287 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-27 07:58:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:58:59,467 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-27 07:58:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:58:59,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:58:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:58:59,544 INFO L225 Difference]: With dead ends: 48043 [2019-12-27 07:58:59,545 INFO L226 Difference]: Without dead ends: 48015 [2019-12-27 07:58:59,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:58:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-27 07:59:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-27 07:59:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-27 07:59:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-27 07:59:00,245 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-27 07:59:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:00,246 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-27 07:59:00,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:59:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-27 07:59:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:59:00,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:00,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] [2019-12-27 07:59:00,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 07:59:00,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:00,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792227470] [2019-12-27 07:59:00,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:00,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792227470] [2019-12-27 07:59:00,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:00,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:59:00,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387275710] [2019-12-27 07:59:00,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:59:00,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:59:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:59:00,328 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-27 07:59:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:00,397 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-27 07:59:00,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:59:00,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:59:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:00,421 INFO L225 Difference]: With dead ends: 12531 [2019-12-27 07:59:00,421 INFO L226 Difference]: Without dead ends: 12531 [2019-12-27 07:59:00,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:59:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-27 07:59:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-27 07:59:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-27 07:59:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-27 07:59:00,613 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-27 07:59:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:00,614 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-27 07:59:00,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:59:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-27 07:59:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:59:00,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:00,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:59:00,631 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-27 07:59:00,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:00,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665672976] [2019-12-27 07:59:00,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:00,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665672976] [2019-12-27 07:59:00,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:00,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:59:00,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476408247] [2019-12-27 07:59:00,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:59:00,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:59:00,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:59:00,768 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 5 states. [2019-12-27 07:59:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:01,011 INFO L93 Difference]: Finished difference Result 11113 states and 34299 transitions. [2019-12-27 07:59:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:59:01,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 07:59:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:01,027 INFO L225 Difference]: With dead ends: 11113 [2019-12-27 07:59:01,027 INFO L226 Difference]: Without dead ends: 11113 [2019-12-27 07:59:01,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:59:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-27 07:59:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10665. [2019-12-27 07:59:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-27 07:59:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 33035 transitions. [2019-12-27 07:59:01,186 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 33035 transitions. Word has length 39 [2019-12-27 07:59:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:01,187 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 33035 transitions. [2019-12-27 07:59:01,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:59:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 33035 transitions. [2019-12-27 07:59:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:01,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:01,203 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] [2019-12-27 07:59:01,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 878583209, now seen corresponding path program 1 times [2019-12-27 07:59:01,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:01,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776848006] [2019-12-27 07:59:01,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:01,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776848006] [2019-12-27 07:59:01,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:01,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:59:01,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723901720] [2019-12-27 07:59:01,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:59:01,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:01,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:59:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:59:01,286 INFO L87 Difference]: Start difference. First operand 10665 states and 33035 transitions. Second operand 4 states. [2019-12-27 07:59:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:01,347 INFO L93 Difference]: Finished difference Result 19424 states and 60142 transitions. [2019-12-27 07:59:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:59:01,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 07:59:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:01,361 INFO L225 Difference]: With dead ends: 19424 [2019-12-27 07:59:01,362 INFO L226 Difference]: Without dead ends: 9092 [2019-12-27 07:59:01,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:59:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2019-12-27 07:59:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 9092. [2019-12-27 07:59:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9092 states. [2019-12-27 07:59:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9092 states to 9092 states and 28032 transitions. [2019-12-27 07:59:01,502 INFO L78 Accepts]: Start accepts. Automaton has 9092 states and 28032 transitions. Word has length 54 [2019-12-27 07:59:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:01,503 INFO L462 AbstractCegarLoop]: Abstraction has 9092 states and 28032 transitions. [2019-12-27 07:59:01,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:59:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 9092 states and 28032 transitions. [2019-12-27 07:59:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:01,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:01,517 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] [2019-12-27 07:59:01,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:01,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash 546394411, now seen corresponding path program 2 times [2019-12-27 07:59:01,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:01,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792707005] [2019-12-27 07:59:01,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:01,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792707005] [2019-12-27 07:59:01,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:01,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:59:01,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113499136] [2019-12-27 07:59:01,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:59:01,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:59:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:59:01,625 INFO L87 Difference]: Start difference. First operand 9092 states and 28032 transitions. Second operand 7 states. [2019-12-27 07:59:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:02,011 INFO L93 Difference]: Finished difference Result 22341 states and 68728 transitions. [2019-12-27 07:59:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:59:02,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:59:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:02,044 INFO L225 Difference]: With dead ends: 22341 [2019-12-27 07:59:02,044 INFO L226 Difference]: Without dead ends: 17627 [2019-12-27 07:59:02,045 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-27 07:59:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2019-12-27 07:59:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 10818. [2019-12-27 07:59:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10818 states. [2019-12-27 07:59:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 33605 transitions. [2019-12-27 07:59:02,276 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 33605 transitions. Word has length 54 [2019-12-27 07:59:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:02,276 INFO L462 AbstractCegarLoop]: Abstraction has 10818 states and 33605 transitions. [2019-12-27 07:59:02,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:59:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 33605 transitions. [2019-12-27 07:59:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:02,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:02,293 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] [2019-12-27 07:59:02,294 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2052295147, now seen corresponding path program 3 times [2019-12-27 07:59:02,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:02,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004639951] [2019-12-27 07:59:02,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:02,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004639951] [2019-12-27 07:59:02,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:02,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:59:02,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143771949] [2019-12-27 07:59:02,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:59:02,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:02,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:59:02,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:59:02,446 INFO L87 Difference]: Start difference. First operand 10818 states and 33605 transitions. Second operand 7 states. [2019-12-27 07:59:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:02,857 INFO L93 Difference]: Finished difference Result 26816 states and 81414 transitions. [2019-12-27 07:59:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:59:02,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:59:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:02,885 INFO L225 Difference]: With dead ends: 26816 [2019-12-27 07:59:02,886 INFO L226 Difference]: Without dead ends: 19206 [2019-12-27 07:59:02,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-27 07:59:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-12-27 07:59:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 12570. [2019-12-27 07:59:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2019-12-27 07:59:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 38891 transitions. [2019-12-27 07:59:03,130 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 38891 transitions. Word has length 54 [2019-12-27 07:59:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:03,130 INFO L462 AbstractCegarLoop]: Abstraction has 12570 states and 38891 transitions. [2019-12-27 07:59:03,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:59:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 38891 transitions. [2019-12-27 07:59:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:03,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:03,148 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] [2019-12-27 07:59:03,148 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash -243349385, now seen corresponding path program 4 times [2019-12-27 07:59:03,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:03,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478557653] [2019-12-27 07:59:03,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:03,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478557653] [2019-12-27 07:59:03,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:03,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:59:03,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665527344] [2019-12-27 07:59:03,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:59:03,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:59:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:59:03,474 INFO L87 Difference]: Start difference. First operand 12570 states and 38891 transitions. Second operand 7 states. [2019-12-27 07:59:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:03,899 INFO L93 Difference]: Finished difference Result 24752 states and 76254 transitions. [2019-12-27 07:59:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:59:03,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:59:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:03,933 INFO L225 Difference]: With dead ends: 24752 [2019-12-27 07:59:03,933 INFO L226 Difference]: Without dead ends: 22870 [2019-12-27 07:59:03,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:59:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22870 states. [2019-12-27 07:59:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22870 to 12633. [2019-12-27 07:59:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12633 states. [2019-12-27 07:59:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 39160 transitions. [2019-12-27 07:59:04,201 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 39160 transitions. Word has length 54 [2019-12-27 07:59:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:04,201 INFO L462 AbstractCegarLoop]: Abstraction has 12633 states and 39160 transitions. [2019-12-27 07:59:04,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:59:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 39160 transitions. [2019-12-27 07:59:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:04,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:04,216 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] [2019-12-27 07:59:04,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 647129887, now seen corresponding path program 1 times [2019-12-27 07:59:04,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:04,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018945] [2019-12-27 07:59:04,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:04,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018945] [2019-12-27 07:59:04,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:04,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:59:04,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195524483] [2019-12-27 07:59:04,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:59:04,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:59:04,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:04,276 INFO L87 Difference]: Start difference. First operand 12633 states and 39160 transitions. Second operand 3 states. [2019-12-27 07:59:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:04,392 INFO L93 Difference]: Finished difference Result 18808 states and 58234 transitions. [2019-12-27 07:59:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:59:04,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:59:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:04,427 INFO L225 Difference]: With dead ends: 18808 [2019-12-27 07:59:04,427 INFO L226 Difference]: Without dead ends: 18808 [2019-12-27 07:59:04,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18808 states. [2019-12-27 07:59:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18808 to 16456. [2019-12-27 07:59:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16456 states. [2019-12-27 07:59:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16456 states to 16456 states and 51479 transitions. [2019-12-27 07:59:04,707 INFO L78 Accepts]: Start accepts. Automaton has 16456 states and 51479 transitions. Word has length 54 [2019-12-27 07:59:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:04,707 INFO L462 AbstractCegarLoop]: Abstraction has 16456 states and 51479 transitions. [2019-12-27 07:59:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:59:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16456 states and 51479 transitions. [2019-12-27 07:59:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:59:04,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:04,727 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] [2019-12-27 07:59:04,727 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1558398603, now seen corresponding path program 5 times [2019-12-27 07:59:04,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:04,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093910610] [2019-12-27 07:59:04,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:04,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093910610] [2019-12-27 07:59:04,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:04,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:59:04,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218934860] [2019-12-27 07:59:04,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:59:04,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:04,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:59:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:04,822 INFO L87 Difference]: Start difference. First operand 16456 states and 51479 transitions. Second operand 3 states. [2019-12-27 07:59:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:04,889 INFO L93 Difference]: Finished difference Result 13349 states and 40700 transitions. [2019-12-27 07:59:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:59:04,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:59:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:04,913 INFO L225 Difference]: With dead ends: 13349 [2019-12-27 07:59:04,913 INFO L226 Difference]: Without dead ends: 13349 [2019-12-27 07:59:04,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13349 states. [2019-12-27 07:59:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13349 to 12872. [2019-12-27 07:59:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-12-27 07:59:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 39150 transitions. [2019-12-27 07:59:05,106 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 39150 transitions. Word has length 54 [2019-12-27 07:59:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:05,106 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 39150 transitions. [2019-12-27 07:59:05,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:59:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 39150 transitions. [2019-12-27 07:59:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:59:05,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:05,124 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] [2019-12-27 07:59:05,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 07:59:05,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:05,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312331169] [2019-12-27 07:59:05,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:05,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312331169] [2019-12-27 07:59:05,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:05,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:59:05,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575275044] [2019-12-27 07:59:05,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:59:05,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:05,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:59:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:59:05,229 INFO L87 Difference]: Start difference. First operand 12872 states and 39150 transitions. Second operand 6 states. [2019-12-27 07:59:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:06,118 INFO L93 Difference]: Finished difference Result 20445 states and 60877 transitions. [2019-12-27 07:59:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:59:06,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 07:59:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:06,146 INFO L225 Difference]: With dead ends: 20445 [2019-12-27 07:59:06,146 INFO L226 Difference]: Without dead ends: 20297 [2019-12-27 07:59:06,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:59:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20297 states. [2019-12-27 07:59:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20297 to 16742. [2019-12-27 07:59:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-27 07:59:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 50459 transitions. [2019-12-27 07:59:06,610 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 50459 transitions. Word has length 55 [2019-12-27 07:59:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:06,611 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 50459 transitions. [2019-12-27 07:59:06,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:59:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 50459 transitions. [2019-12-27 07:59:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:59:06,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:06,634 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] [2019-12-27 07:59:06,634 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 41129598, now seen corresponding path program 2 times [2019-12-27 07:59:06,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45283168] [2019-12-27 07:59:06,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:06,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45283168] [2019-12-27 07:59:06,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:06,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:59:06,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636214067] [2019-12-27 07:59:06,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:59:06,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:59:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:59:06,759 INFO L87 Difference]: Start difference. First operand 16742 states and 50459 transitions. Second operand 7 states. [2019-12-27 07:59:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:07,650 INFO L93 Difference]: Finished difference Result 25121 states and 74006 transitions. [2019-12-27 07:59:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:59:07,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 07:59:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:07,686 INFO L225 Difference]: With dead ends: 25121 [2019-12-27 07:59:07,686 INFO L226 Difference]: Without dead ends: 25121 [2019-12-27 07:59:07,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:59:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25121 states. [2019-12-27 07:59:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25121 to 17944. [2019-12-27 07:59:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17944 states. [2019-12-27 07:59:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17944 states to 17944 states and 53943 transitions. [2019-12-27 07:59:08,000 INFO L78 Accepts]: Start accepts. Automaton has 17944 states and 53943 transitions. Word has length 55 [2019-12-27 07:59:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:08,000 INFO L462 AbstractCegarLoop]: Abstraction has 17944 states and 53943 transitions. [2019-12-27 07:59:08,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:59:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17944 states and 53943 transitions. [2019-12-27 07:59:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:59:08,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:08,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] [2019-12-27 07:59:08,018 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 3 times [2019-12-27 07:59:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:08,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925117860] [2019-12-27 07:59:08,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:08,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925117860] [2019-12-27 07:59:08,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:08,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:59:08,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914901378] [2019-12-27 07:59:08,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:59:08,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:59:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:08,090 INFO L87 Difference]: Start difference. First operand 17944 states and 53943 transitions. Second operand 3 states. [2019-12-27 07:59:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:08,154 INFO L93 Difference]: Finished difference Result 17942 states and 53938 transitions. [2019-12-27 07:59:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:59:08,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:59:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:08,180 INFO L225 Difference]: With dead ends: 17942 [2019-12-27 07:59:08,181 INFO L226 Difference]: Without dead ends: 17942 [2019-12-27 07:59:08,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:59:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17942 states. [2019-12-27 07:59:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17942 to 16188. [2019-12-27 07:59:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16188 states. [2019-12-27 07:59:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16188 states to 16188 states and 49070 transitions. [2019-12-27 07:59:08,443 INFO L78 Accepts]: Start accepts. Automaton has 16188 states and 49070 transitions. Word has length 55 [2019-12-27 07:59:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:08,443 INFO L462 AbstractCegarLoop]: Abstraction has 16188 states and 49070 transitions. [2019-12-27 07:59:08,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:59:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16188 states and 49070 transitions. [2019-12-27 07:59:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:08,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:08,460 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] [2019-12-27 07:59:08,460 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1955053525, now seen corresponding path program 1 times [2019-12-27 07:59:08,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:08,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485238885] [2019-12-27 07:59:08,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:08,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485238885] [2019-12-27 07:59:08,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:08,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:59:08,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80786557] [2019-12-27 07:59:08,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:59:08,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:08,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:59:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:59:08,904 INFO L87 Difference]: Start difference. First operand 16188 states and 49070 transitions. Second operand 13 states. [2019-12-27 07:59:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:11,952 INFO L93 Difference]: Finished difference Result 28449 states and 84662 transitions. [2019-12-27 07:59:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 07:59:11,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-27 07:59:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:11,990 INFO L225 Difference]: With dead ends: 28449 [2019-12-27 07:59:11,990 INFO L226 Difference]: Without dead ends: 26920 [2019-12-27 07:59:11,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 07:59:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26920 states. [2019-12-27 07:59:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26920 to 19372. [2019-12-27 07:59:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19372 states. [2019-12-27 07:59:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19372 states to 19372 states and 58504 transitions. [2019-12-27 07:59:12,314 INFO L78 Accepts]: Start accepts. Automaton has 19372 states and 58504 transitions. Word has length 56 [2019-12-27 07:59:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:12,315 INFO L462 AbstractCegarLoop]: Abstraction has 19372 states and 58504 transitions. [2019-12-27 07:59:12,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:59:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19372 states and 58504 transitions. [2019-12-27 07:59:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:12,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:12,335 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] [2019-12-27 07:59:12,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1936535503, now seen corresponding path program 2 times [2019-12-27 07:59:12,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:12,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555359367] [2019-12-27 07:59:12,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:12,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555359367] [2019-12-27 07:59:12,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:12,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:59:12,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155591407] [2019-12-27 07:59:12,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:59:12,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:59:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:59:12,970 INFO L87 Difference]: Start difference. First operand 19372 states and 58504 transitions. Second operand 17 states. [2019-12-27 07:59:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:18,035 INFO L93 Difference]: Finished difference Result 34397 states and 102148 transitions. [2019-12-27 07:59:18,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 07:59:18,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 07:59:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:18,070 INFO L225 Difference]: With dead ends: 34397 [2019-12-27 07:59:18,070 INFO L226 Difference]: Without dead ends: 24549 [2019-12-27 07:59:18,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 07:59:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24549 states. [2019-12-27 07:59:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24549 to 19128. [2019-12-27 07:59:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19128 states. [2019-12-27 07:59:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19128 states to 19128 states and 57042 transitions. [2019-12-27 07:59:18,387 INFO L78 Accepts]: Start accepts. Automaton has 19128 states and 57042 transitions. Word has length 56 [2019-12-27 07:59:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:18,388 INFO L462 AbstractCegarLoop]: Abstraction has 19128 states and 57042 transitions. [2019-12-27 07:59:18,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:59:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 19128 states and 57042 transitions. [2019-12-27 07:59:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:18,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:18,407 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] [2019-12-27 07:59:18,407 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1364903057, now seen corresponding path program 3 times [2019-12-27 07:59:18,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:18,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954885605] [2019-12-27 07:59:18,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:18,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954885605] [2019-12-27 07:59:18,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:18,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:59:18,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564654326] [2019-12-27 07:59:18,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:59:18,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:59:18,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:59:18,780 INFO L87 Difference]: Start difference. First operand 19128 states and 57042 transitions. Second operand 14 states. [2019-12-27 07:59:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:21,424 INFO L93 Difference]: Finished difference Result 29741 states and 87862 transitions. [2019-12-27 07:59:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 07:59:21,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 07:59:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:21,467 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 07:59:21,467 INFO L226 Difference]: Without dead ends: 23288 [2019-12-27 07:59:21,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 07:59:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23288 states. [2019-12-27 07:59:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23288 to 17762. [2019-12-27 07:59:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-12-27 07:59:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 52864 transitions. [2019-12-27 07:59:22,021 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 52864 transitions. Word has length 56 [2019-12-27 07:59:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:22,021 INFO L462 AbstractCegarLoop]: Abstraction has 17762 states and 52864 transitions. [2019-12-27 07:59:22,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 07:59:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 52864 transitions. [2019-12-27 07:59:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:22,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:22,038 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] [2019-12-27 07:59:22,038 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:22,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1322617943, now seen corresponding path program 4 times [2019-12-27 07:59:22,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:22,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062653845] [2019-12-27 07:59:22,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:22,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062653845] [2019-12-27 07:59:22,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:22,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:59:22,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261133465] [2019-12-27 07:59:22,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:59:22,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:59:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:59:22,446 INFO L87 Difference]: Start difference. First operand 17762 states and 52864 transitions. Second operand 16 states. [2019-12-27 07:59:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:25,664 INFO L93 Difference]: Finished difference Result 23803 states and 70307 transitions. [2019-12-27 07:59:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 07:59:25,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 07:59:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:25,696 INFO L225 Difference]: With dead ends: 23803 [2019-12-27 07:59:25,697 INFO L226 Difference]: Without dead ends: 22900 [2019-12-27 07:59:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 07:59:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22900 states. [2019-12-27 07:59:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22900 to 17555. [2019-12-27 07:59:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17555 states. [2019-12-27 07:59:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17555 states to 17555 states and 52314 transitions. [2019-12-27 07:59:25,983 INFO L78 Accepts]: Start accepts. Automaton has 17555 states and 52314 transitions. Word has length 56 [2019-12-27 07:59:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:25,983 INFO L462 AbstractCegarLoop]: Abstraction has 17555 states and 52314 transitions. [2019-12-27 07:59:25,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:59:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 17555 states and 52314 transitions. [2019-12-27 07:59:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:26,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:26,001 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] [2019-12-27 07:59:26,001 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -739724749, now seen corresponding path program 5 times [2019-12-27 07:59:26,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:26,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452400530] [2019-12-27 07:59:26,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452400530] [2019-12-27 07:59:26,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:26,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:59:26,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898743130] [2019-12-27 07:59:26,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 07:59:26,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 07:59:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:59:26,442 INFO L87 Difference]: Start difference. First operand 17555 states and 52314 transitions. Second operand 18 states. [2019-12-27 07:59:28,404 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-27 07:59:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:29,233 INFO L93 Difference]: Finished difference Result 27278 states and 79651 transitions. [2019-12-27 07:59:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 07:59:29,235 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 07:59:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:29,269 INFO L225 Difference]: With dead ends: 27278 [2019-12-27 07:59:29,269 INFO L226 Difference]: Without dead ends: 25816 [2019-12-27 07:59:29,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1426, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 07:59:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25816 states. [2019-12-27 07:59:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25816 to 17775. [2019-12-27 07:59:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17775 states. [2019-12-27 07:59:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17775 states to 17775 states and 52855 transitions. [2019-12-27 07:59:29,580 INFO L78 Accepts]: Start accepts. Automaton has 17775 states and 52855 transitions. Word has length 56 [2019-12-27 07:59:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:29,580 INFO L462 AbstractCegarLoop]: Abstraction has 17775 states and 52855 transitions. [2019-12-27 07:59:29,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 07:59:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17775 states and 52855 transitions. [2019-12-27 07:59:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:29,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:29,598 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] [2019-12-27 07:59:29,599 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 169122739, now seen corresponding path program 6 times [2019-12-27 07:59:29,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:29,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680714535] [2019-12-27 07:59:29,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:29,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680714535] [2019-12-27 07:59:29,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:29,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:59:29,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055656369] [2019-12-27 07:59:29,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:59:29,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:29,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:59:29,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:59:29,761 INFO L87 Difference]: Start difference. First operand 17775 states and 52855 transitions. Second operand 12 states. [2019-12-27 07:59:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:31,339 INFO L93 Difference]: Finished difference Result 23536 states and 69374 transitions. [2019-12-27 07:59:31,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:59:31,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:59:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:31,380 INFO L225 Difference]: With dead ends: 23536 [2019-12-27 07:59:31,380 INFO L226 Difference]: Without dead ends: 22872 [2019-12-27 07:59:31,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:59:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22872 states. [2019-12-27 07:59:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22872 to 17635. [2019-12-27 07:59:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17635 states. [2019-12-27 07:59:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 52506 transitions. [2019-12-27 07:59:31,877 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 52506 transitions. Word has length 56 [2019-12-27 07:59:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:31,877 INFO L462 AbstractCegarLoop]: Abstraction has 17635 states and 52506 transitions. [2019-12-27 07:59:31,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:59:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 52506 transitions. [2019-12-27 07:59:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:31,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:31,905 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] [2019-12-27 07:59:31,905 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash -515473783, now seen corresponding path program 7 times [2019-12-27 07:59:31,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:31,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182631422] [2019-12-27 07:59:31,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182631422] [2019-12-27 07:59:32,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:32,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 07:59:32,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037066860] [2019-12-27 07:59:32,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 07:59:32,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 07:59:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:59:32,518 INFO L87 Difference]: Start difference. First operand 17635 states and 52506 transitions. Second operand 22 states. [2019-12-27 07:59:34,019 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-27 07:59:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:36,200 INFO L93 Difference]: Finished difference Result 25758 states and 75451 transitions. [2019-12-27 07:59:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 07:59:36,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-12-27 07:59:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:36,236 INFO L225 Difference]: With dead ends: 25758 [2019-12-27 07:59:36,236 INFO L226 Difference]: Without dead ends: 25454 [2019-12-27 07:59:36,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=376, Invalid=1786, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 07:59:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25454 states. [2019-12-27 07:59:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25454 to 17633. [2019-12-27 07:59:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17633 states. [2019-12-27 07:59:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17633 states to 17633 states and 52501 transitions. [2019-12-27 07:59:36,539 INFO L78 Accepts]: Start accepts. Automaton has 17633 states and 52501 transitions. Word has length 56 [2019-12-27 07:59:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:36,539 INFO L462 AbstractCegarLoop]: Abstraction has 17633 states and 52501 transitions. [2019-12-27 07:59:36,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 07:59:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17633 states and 52501 transitions. [2019-12-27 07:59:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:36,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:36,558 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] [2019-12-27 07:59:36,559 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1819205093, now seen corresponding path program 8 times [2019-12-27 07:59:36,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:36,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407912655] [2019-12-27 07:59:36,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:37,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407912655] [2019-12-27 07:59:37,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:37,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 07:59:37,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197127368] [2019-12-27 07:59:37,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 07:59:37,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 07:59:37,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:59:37,190 INFO L87 Difference]: Start difference. First operand 17633 states and 52501 transitions. Second operand 23 states. [2019-12-27 07:59:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:41,192 INFO L93 Difference]: Finished difference Result 25688 states and 75279 transitions. [2019-12-27 07:59:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 07:59:41,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2019-12-27 07:59:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:41,226 INFO L225 Difference]: With dead ends: 25688 [2019-12-27 07:59:41,226 INFO L226 Difference]: Without dead ends: 25336 [2019-12-27 07:59:41,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=1959, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 07:59:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25336 states. [2019-12-27 07:59:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25336 to 17557. [2019-12-27 07:59:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17557 states. [2019-12-27 07:59:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17557 states to 17557 states and 52319 transitions. [2019-12-27 07:59:41,740 INFO L78 Accepts]: Start accepts. Automaton has 17557 states and 52319 transitions. Word has length 56 [2019-12-27 07:59:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:41,741 INFO L462 AbstractCegarLoop]: Abstraction has 17557 states and 52319 transitions. [2019-12-27 07:59:41,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 07:59:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17557 states and 52319 transitions. [2019-12-27 07:59:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:41,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:41,759 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] [2019-12-27 07:59:41,760 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1589005963, now seen corresponding path program 9 times [2019-12-27 07:59:41,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:41,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285904175] [2019-12-27 07:59:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:41,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285904175] [2019-12-27 07:59:41,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:41,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:59:41,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999138451] [2019-12-27 07:59:41,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:59:41,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:59:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:59:41,936 INFO L87 Difference]: Start difference. First operand 17557 states and 52319 transitions. Second operand 12 states. [2019-12-27 07:59:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:43,345 INFO L93 Difference]: Finished difference Result 23428 states and 69075 transitions. [2019-12-27 07:59:43,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:59:43,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:59:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:43,374 INFO L225 Difference]: With dead ends: 23428 [2019-12-27 07:59:43,374 INFO L226 Difference]: Without dead ends: 21754 [2019-12-27 07:59:43,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:59:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21754 states. [2019-12-27 07:59:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21754 to 17299. [2019-12-27 07:59:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17299 states. [2019-12-27 07:59:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17299 states to 17299 states and 51463 transitions. [2019-12-27 07:59:43,655 INFO L78 Accepts]: Start accepts. Automaton has 17299 states and 51463 transitions. Word has length 56 [2019-12-27 07:59:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:43,655 INFO L462 AbstractCegarLoop]: Abstraction has 17299 states and 51463 transitions. [2019-12-27 07:59:43,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:59:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17299 states and 51463 transitions. [2019-12-27 07:59:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:43,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:43,679 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] [2019-12-27 07:59:43,679 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1797113845, now seen corresponding path program 10 times [2019-12-27 07:59:43,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:43,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770606176] [2019-12-27 07:59:43,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:44,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770606176] [2019-12-27 07:59:44,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:44,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:59:44,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004496403] [2019-12-27 07:59:44,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:59:44,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:44,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:59:44,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:59:44,152 INFO L87 Difference]: Start difference. First operand 17299 states and 51463 transitions. Second operand 20 states. [2019-12-27 07:59:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:47,746 INFO L93 Difference]: Finished difference Result 26103 states and 76116 transitions. [2019-12-27 07:59:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 07:59:47,746 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 07:59:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:47,783 INFO L225 Difference]: With dead ends: 26103 [2019-12-27 07:59:47,783 INFO L226 Difference]: Without dead ends: 25641 [2019-12-27 07:59:47,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 07:59:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25641 states. [2019-12-27 07:59:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25641 to 17361. [2019-12-27 07:59:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17361 states. [2019-12-27 07:59:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17361 states to 17361 states and 51616 transitions. [2019-12-27 07:59:48,064 INFO L78 Accepts]: Start accepts. Automaton has 17361 states and 51616 transitions. Word has length 56 [2019-12-27 07:59:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:48,064 INFO L462 AbstractCegarLoop]: Abstraction has 17361 states and 51616 transitions. [2019-12-27 07:59:48,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:59:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17361 states and 51616 transitions. [2019-12-27 07:59:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:48,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:48,081 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] [2019-12-27 07:59:48,081 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1813256929, now seen corresponding path program 11 times [2019-12-27 07:59:48,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:48,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901257994] [2019-12-27 07:59:48,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:59:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:59:48,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901257994] [2019-12-27 07:59:48,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:59:48,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:59:48,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628150547] [2019-12-27 07:59:48,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:59:48,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:59:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:59:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:59:48,383 INFO L87 Difference]: Start difference. First operand 17361 states and 51616 transitions. Second operand 15 states. [2019-12-27 07:59:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:59:50,624 INFO L93 Difference]: Finished difference Result 22010 states and 65095 transitions. [2019-12-27 07:59:50,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:59:50,625 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:59:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:59:50,654 INFO L225 Difference]: With dead ends: 22010 [2019-12-27 07:59:50,654 INFO L226 Difference]: Without dead ends: 21418 [2019-12-27 07:59:50,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 07:59:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21418 states. [2019-12-27 07:59:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21418 to 16991. [2019-12-27 07:59:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16991 states. [2019-12-27 07:59:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16991 states to 16991 states and 50706 transitions. [2019-12-27 07:59:50,920 INFO L78 Accepts]: Start accepts. Automaton has 16991 states and 50706 transitions. Word has length 56 [2019-12-27 07:59:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:59:50,920 INFO L462 AbstractCegarLoop]: Abstraction has 16991 states and 50706 transitions. [2019-12-27 07:59:50,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:59:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16991 states and 50706 transitions. [2019-12-27 07:59:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:59:50,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:59:50,936 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] [2019-12-27 07:59:50,936 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:59:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:59:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 12 times [2019-12-27 07:59:50,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:59:50,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156495454] [2019-12-27 07:59:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:59:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:59:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:59:51,042 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:59:51,042 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:59:51,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19|) |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| 4) |v_#length_21|) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2357~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19| 1) |v_#valid_51|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19|)) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_21|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:59:51,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:59:51,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-27 07:59:51,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= 1 ~x$w_buff0~0_Out2143439657) (= P1Thread1of1ForFork0_~arg.offset_Out2143439657 |P1Thread1of1ForFork0_#in~arg.offset_In2143439657|) (= ~x$w_buff0_used~0_In2143439657 ~x$w_buff1_used~0_Out2143439657) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2143439657| 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2143439657| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out2143439657) (= ~x$w_buff0~0_In2143439657 ~x$w_buff1~0_Out2143439657) (= 0 (mod ~x$w_buff1_used~0_Out2143439657 256)) (= P1Thread1of1ForFork0_~arg.base_Out2143439657 |P1Thread1of1ForFork0_#in~arg.base_In2143439657|) (= 1 ~x$w_buff0_used~0_Out2143439657)) InVars {~x$w_buff0~0=~x$w_buff0~0_In2143439657, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In2143439657|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In2143439657|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2143439657} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out2143439657, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out2143439657, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out2143439657, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out2143439657, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out2143439657|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In2143439657|, ~x$w_buff1~0=~x$w_buff1~0_Out2143439657, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In2143439657|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out2143439657, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out2143439657} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:59:51,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-807518681 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-807518681 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-807518681| ~x$w_buff1~0_In-807518681) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-807518681| ~x~0_In-807518681)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-807518681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-807518681, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807518681, ~x~0=~x~0_In-807518681} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-807518681|, ~x$w_buff1~0=~x$w_buff1~0_In-807518681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-807518681, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807518681, ~x~0=~x~0_In-807518681} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:59:51,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:59:51,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1263462063 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1263462063 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1263462063 |P2Thread1of1ForFork1_#t~ite34_Out1263462063|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1263462063|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1263462063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1263462063} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1263462063|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1263462063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1263462063} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:59:51,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1667952923 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1667952923 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1667952923| ~x$w_buff0_used~0_In1667952923)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1667952923| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1667952923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1667952923, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1667952923|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:59:51,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-590278304 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-590278304 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-590278304 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-590278304 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-590278304| ~x$w_buff1_used~0_In-590278304)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-590278304| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-590278304, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-590278304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-590278304, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-590278304, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-590278304|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:59:51,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1855764544 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1855764544 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1855764544) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1855764544 ~x$r_buff0_thd2~0_Out1855764544) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1855764544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1855764544|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1855764544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:59:51,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1279462671 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1279462671 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1279462671 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1279462671 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1279462671 |P1Thread1of1ForFork0_#t~ite31_Out-1279462671|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1279462671|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1279462671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1279462671|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1279462671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:59:51,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:59:51,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2145822420 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-2145822420 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-2145822420 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-2145822420 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-2145822420 256)))) (= |P0Thread1of1ForFork2_#t~ite12_Out-2145822420| |P0Thread1of1ForFork2_#t~ite11_Out-2145822420|) .cse1 (= ~x$w_buff1~0_In-2145822420 |P0Thread1of1ForFork2_#t~ite11_Out-2145822420|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite11_In-2145822420| |P0Thread1of1ForFork2_#t~ite11_Out-2145822420|) (= ~x$w_buff1~0_In-2145822420 |P0Thread1of1ForFork2_#t~ite12_Out-2145822420|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2145822420, ~x$w_buff1~0=~x$w_buff1~0_In-2145822420, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2145822420, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2145822420, ~weak$$choice2~0=~weak$$choice2~0_In-2145822420, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-2145822420|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145822420} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2145822420, ~x$w_buff1~0=~x$w_buff1~0_In-2145822420, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2145822420, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2145822420, ~weak$$choice2~0=~weak$$choice2~0_In-2145822420, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-2145822420|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-2145822420|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2145822420} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:59:51,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1079725750 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1079725750| |P0Thread1of1ForFork2_#t~ite15_Out1079725750|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1079725750 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1079725750 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1079725750 256))) (= 0 (mod ~x$w_buff0_used~0_In1079725750 256)))) (= ~x$w_buff0_used~0_In1079725750 |P0Thread1of1ForFork2_#t~ite14_Out1079725750|)) (and (= |P0Thread1of1ForFork2_#t~ite14_In1079725750| |P0Thread1of1ForFork2_#t~ite14_Out1079725750|) (not .cse0) (= ~x$w_buff0_used~0_In1079725750 |P0Thread1of1ForFork2_#t~ite15_Out1079725750|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1079725750, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1079725750, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1079725750, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1079725750|, ~weak$$choice2~0=~weak$$choice2~0_In1079725750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079725750} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1079725750, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1079725750, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1079725750|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1079725750, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1079725750|, ~weak$$choice2~0=~weak$$choice2~0_In1079725750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1079725750} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:59:51,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff1_used~0_In993737557 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In993737557 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In993737557 256) 0)) (.cse5 (= (mod ~x$w_buff0_used~0_In993737557 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In993737557 256))) (.cse1 (= |P0Thread1of1ForFork2_#t~ite18_Out993737557| |P0Thread1of1ForFork2_#t~ite17_Out993737557|))) (or (let ((.cse2 (not .cse6))) (and .cse0 .cse1 (or .cse2 (not .cse3)) (= |P0Thread1of1ForFork2_#t~ite17_Out993737557| |P0Thread1of1ForFork2_#t~ite16_Out993737557|) (or (not .cse4) .cse2) (= |P0Thread1of1ForFork2_#t~ite16_Out993737557| 0) (not .cse5))) (and (= |P0Thread1of1ForFork2_#t~ite16_In993737557| |P0Thread1of1ForFork2_#t~ite16_Out993737557|) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out993737557| |P0Thread1of1ForFork2_#t~ite17_In993737557|) (= |P0Thread1of1ForFork2_#t~ite18_Out993737557| ~x$w_buff1_used~0_In993737557)) (and (or (and .cse6 .cse4) (and .cse6 .cse3) .cse5) .cse0 .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out993737557| ~x$w_buff1_used~0_In993737557)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In993737557, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In993737557|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In993737557, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In993737557|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In993737557, ~weak$$choice2~0=~weak$$choice2~0_In993737557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993737557} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In993737557, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out993737557|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out993737557|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In993737557, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out993737557|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In993737557, ~weak$$choice2~0=~weak$$choice2~0_In993737557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993737557} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:59:51,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 07:59:51,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-427778829 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-427778829 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In-427778829 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-427778829 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out-427778829| |P0Thread1of1ForFork2_#t~ite23_Out-427778829|)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-427778829 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In-427778829| |P0Thread1of1ForFork2_#t~ite22_Out-427778829|) (or (and (= ~x$r_buff1_thd1~0_In-427778829 |P0Thread1of1ForFork2_#t~ite23_Out-427778829|) (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) .cse4 .cse5) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-427778829| ~x$r_buff1_thd1~0_In-427778829) (= |P0Thread1of1ForFork2_#t~ite23_In-427778829| |P0Thread1of1ForFork2_#t~ite23_Out-427778829|) (not .cse4)))) (let ((.cse6 (not .cse1))) (and (not .cse0) (or .cse6 (not .cse2)) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-427778829|) .cse4 (or .cse6 (not .cse3)) (= |P0Thread1of1ForFork2_#t~ite22_Out-427778829| |P0Thread1of1ForFork2_#t~ite23_Out-427778829|) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-427778829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427778829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427778829, ~weak$$choice2~0=~weak$$choice2~0_In-427778829, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-427778829|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-427778829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427778829} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-427778829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-427778829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-427778829, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-427778829|, ~weak$$choice2~0=~weak$$choice2~0_In-427778829, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-427778829|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-427778829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427778829} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:59:51,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:59:51,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-503931968 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-503931968 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-503931968 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-503931968 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-503931968 |P2Thread1of1ForFork1_#t~ite35_Out-503931968|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-503931968|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-503931968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-503931968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-503931968|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503931968, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-503931968, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:59:51,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1731900509 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1731900509 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In1731900509 |P2Thread1of1ForFork1_#t~ite36_Out1731900509|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1731900509|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1731900509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1731900509|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1731900509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:59:51,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-966033253 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-966033253 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-966033253 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-966033253 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-966033253| ~x$r_buff1_thd3~0_In-966033253) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-966033253|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-966033253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-966033253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-966033253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966033253} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-966033253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966033253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-966033253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-966033253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966033253} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:59:51,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 07:59:51,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:59:51,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In599821215 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In599821215 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out599821215| ~x$w_buff1~0_In599821215) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In599821215 |ULTIMATE.start_main_#t~ite41_Out599821215|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In599821215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In599821215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In599821215, ~x~0=~x~0_In599821215} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out599821215|, ~x$w_buff1~0=~x$w_buff1~0_In599821215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In599821215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In599821215, ~x~0=~x~0_In599821215} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:59:51,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:59:51,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-111710863 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-111710863 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-111710863| ~x$w_buff0_used~0_In-111710863)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-111710863|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-111710863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:59:51,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1607593599 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1607593599 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1607593599 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1607593599 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1607593599| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1607593599 |ULTIMATE.start_main_#t~ite44_Out1607593599|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1607593599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1607593599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1607593599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1607593599} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1607593599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1607593599, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1607593599, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1607593599|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1607593599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:59:51,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In886584743 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In886584743 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out886584743| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In886584743 |ULTIMATE.start_main_#t~ite45_Out886584743|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886584743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886584743} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886584743, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out886584743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886584743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:59:51,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-649290389 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-649290389 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-649290389 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-649290389 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-649290389| 0)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-649290389 |ULTIMATE.start_main_#t~ite46_Out-649290389|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-649290389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-649290389, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-649290389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649290389} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-649290389, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-649290389|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-649290389, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-649290389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649290389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:59:51,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:59:51,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:59:51 BasicIcfg [2019-12-27 07:59:51,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:59:51,135 INFO L168 Benchmark]: Toolchain (without parser) took 100443.76 ms. Allocated memory was 145.8 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 908.5 MB in the end (delta: -808.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,135 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.31 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 156.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,137 INFO L168 Benchmark]: Boogie Preprocessor took 39.42 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,137 INFO L168 Benchmark]: RCFGBuilder took 769.78 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 104.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,138 INFO L168 Benchmark]: TraceAbstraction took 98749.62 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.1 MB in the beginning and 908.5 MB in the end (delta: -804.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:59:51,141 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.31 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 156.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.42 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.78 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 104.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98749.62 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.1 MB in the beginning and 908.5 MB in the end (delta: -804.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.4s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5594 SDtfs, 7930 SDslu, 25387 SDs, 0 SdLazy, 30698 SolverSat, 593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 146398 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1209 ConstructedInterpolants, 0 QuantifiedInterpolants, 349435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...