/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:18:18,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:18:18,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:18:18,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:18:18,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:18:18,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:18:18,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:18:18,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:18:18,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:18:18,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:18:18,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:18:18,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:18:18,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:18:18,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:18:18,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:18:18,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:18:18,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:18:18,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:18:18,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:18:18,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:18:18,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:18:18,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:18:18,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:18:18,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:18:18,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:18:18,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:18:18,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:18:18,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:18:18,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:18:18,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:18:18,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:18:18,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:18:18,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:18:18,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:18:18,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:18:18,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:18:18,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:18:18,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:18:18,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:18:18,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:18:18,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:18:18,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:18:18,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:18:18,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:18:18,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:18:18,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:18:18,531 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:18:18,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:18:18,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:18:18,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:18:18,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:18:18,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:18:18,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:18:18,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:18:18,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:18:18,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:18:18,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:18:18,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:18:18,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:18:18,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:18:18,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:18:18,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:18:18,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:18:18,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:18:18,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:18:18,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:18:18,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:18:18,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:18:18,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:18:18,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:18:18,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:18:18,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:18:18,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:18:18,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:18:18,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:18:18,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:18:18,854 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:18:18,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-18 13:18:18,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c989d0055/da548fcad32a4002992a1832befa36a4/FLAG4571dbceb [2019-12-18 13:18:19,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:18:19,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-18 13:18:19,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c989d0055/da548fcad32a4002992a1832befa36a4/FLAG4571dbceb [2019-12-18 13:18:19,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c989d0055/da548fcad32a4002992a1832befa36a4 [2019-12-18 13:18:19,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:18:19,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:18:19,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:19,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:18:19,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:18:19,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:19" (1/1) ... [2019-12-18 13:18:19,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af0a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:19, skipping insertion in model container [2019-12-18 13:18:19,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:19" (1/1) ... [2019-12-18 13:18:19,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:18:19,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:18:20,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:20,404 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:18:20,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:20,558 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:18:20,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20 WrapperNode [2019-12-18 13:18:20,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:20,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:20,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:18:20,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:18:20,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:20,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:18:20,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:18:20,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:18:20,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... [2019-12-18 13:18:20,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:18:20,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:18:20,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:18:20,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:18:20,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:18:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:18:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:18:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:18:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:18:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:18:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:18:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:18:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:18:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:18:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:18:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:18:20,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:18:20,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:18:20,744 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:18:21,549 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:18:21,549 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:18:21,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:21 BoogieIcfgContainer [2019-12-18 13:18:21,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:18:21,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:18:21,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:18:21,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:18:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:18:19" (1/3) ... [2019-12-18 13:18:21,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8c0fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:21, skipping insertion in model container [2019-12-18 13:18:21,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:20" (2/3) ... [2019-12-18 13:18:21,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8c0fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:21, skipping insertion in model container [2019-12-18 13:18:21,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:21" (3/3) ... [2019-12-18 13:18:21,560 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.oepc.i [2019-12-18 13:18:21,571 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:18:21,571 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:18:21,579 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:18:21,580 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:18:21,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,659 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,687 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:21,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:18:21,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:18:21,745 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:18:21,745 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:18:21,745 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:18:21,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:18:21,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:18:21,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:18:21,746 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:18:21,763 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 13:18:21,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:21,873 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:21,873 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:21,902 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:21,932 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:21,996 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:21,996 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:22,006 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:22,027 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:18:22,029 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:18:27,386 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:18:27,518 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:18:27,681 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-18 13:18:27,682 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:18:27,686 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 13:18:47,005 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-18 13:18:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-18 13:18:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:18:47,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:47,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:18:47,014 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-18 13:18:47,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:47,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053503146] [2019-12-18 13:18:47,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:47,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053503146] [2019-12-18 13:18:47,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:47,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:18:47,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704913136] [2019-12-18 13:18:47,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:47,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:47,262 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-18 13:18:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:51,093 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-18 13:18:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:51,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:18:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:51,831 INFO L225 Difference]: With dead ends: 117122 [2019-12-18 13:18:51,832 INFO L226 Difference]: Without dead ends: 109842 [2019-12-18 13:18:51,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-18 13:18:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-18 13:18:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-18 13:19:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-18 13:19:00,238 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-18 13:19:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:00,238 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-18 13:19:00,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-18 13:19:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:19:00,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:00,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:00,243 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-18 13:19:00,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:00,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466987602] [2019-12-18 13:19:00,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:00,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466987602] [2019-12-18 13:19:00,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:00,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:00,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362741276] [2019-12-18 13:19:00,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:00,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:00,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:00,387 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-18 13:19:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:05,290 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-18 13:19:05,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:05,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:19:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:06,723 INFO L225 Difference]: With dead ends: 170700 [2019-12-18 13:19:06,723 INFO L226 Difference]: Without dead ends: 170651 [2019-12-18 13:19:06,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-18 13:19:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-18 13:19:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-18 13:19:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-18 13:19:20,997 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-18 13:19:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:20,997 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-18 13:19:20,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-18 13:19:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:19:21,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:21,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:21,005 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-18 13:19:21,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:21,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281871944] [2019-12-18 13:19:21,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:21,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281871944] [2019-12-18 13:19:21,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:21,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:21,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210644195] [2019-12-18 13:19:21,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:21,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:21,083 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-18 13:19:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:21,215 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-18 13:19:21,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:21,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:19:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:21,272 INFO L225 Difference]: With dead ends: 33806 [2019-12-18 13:19:21,272 INFO L226 Difference]: Without dead ends: 33806 [2019-12-18 13:19:21,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-18 13:19:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-18 13:19:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-18 13:19:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-18 13:19:27,023 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-18 13:19:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:27,023 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-18 13:19:27,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-18 13:19:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:27,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:27,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:27,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-18 13:19:27,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:27,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000341879] [2019-12-18 13:19:27,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:27,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000341879] [2019-12-18 13:19:27,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:27,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:27,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203750050] [2019-12-18 13:19:27,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:27,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:27,124 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-18 13:19:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:27,329 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-18 13:19:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:27,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:19:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:27,414 INFO L225 Difference]: With dead ends: 52205 [2019-12-18 13:19:27,414 INFO L226 Difference]: Without dead ends: 52205 [2019-12-18 13:19:27,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-18 13:19:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-18 13:19:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-18 13:19:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-18 13:19:28,191 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-18 13:19:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:28,192 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-18 13:19:28,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-18 13:19:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:28,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:28,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:28,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-18 13:19:28,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:28,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563647159] [2019-12-18 13:19:28,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:28,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563647159] [2019-12-18 13:19:28,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:28,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:28,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609897796] [2019-12-18 13:19:28,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:28,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:28,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:28,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:28,277 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-18 13:19:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:28,666 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-18 13:19:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:28,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:28,743 INFO L225 Difference]: With dead ends: 46485 [2019-12-18 13:19:28,744 INFO L226 Difference]: Without dead ends: 46485 [2019-12-18 13:19:28,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-18 13:19:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-18 13:19:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-18 13:19:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-18 13:19:29,791 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-18 13:19:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:29,791 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-18 13:19:29,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-18 13:19:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:29,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:29,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:29,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-18 13:19:29,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:29,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831461894] [2019-12-18 13:19:29,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:29,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831461894] [2019-12-18 13:19:29,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:29,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:29,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802499257] [2019-12-18 13:19:29,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:29,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:29,866 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-18 13:19:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:30,267 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-18 13:19:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:30,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:30,365 INFO L225 Difference]: With dead ends: 51005 [2019-12-18 13:19:30,365 INFO L226 Difference]: Without dead ends: 51005 [2019-12-18 13:19:30,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-18 13:19:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-18 13:19:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-18 13:19:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-18 13:19:31,653 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-18 13:19:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:31,653 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-18 13:19:31,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-18 13:19:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:31,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:31,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:31,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-18 13:19:31,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:31,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813813037] [2019-12-18 13:19:31,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:31,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-18 13:19:31,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813813037] [2019-12-18 13:19:31,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:31,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:31,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053329188] [2019-12-18 13:19:31,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:31,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:31,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:31,781 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-18 13:19:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:32,567 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-18 13:19:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:32,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:32,671 INFO L225 Difference]: With dead ends: 60565 [2019-12-18 13:19:32,671 INFO L226 Difference]: Without dead ends: 60558 [2019-12-18 13:19:32,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-18 13:19:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-18 13:19:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-18 13:19:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-18 13:19:33,574 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-18 13:19:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:33,575 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-18 13:19:33,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-18 13:19:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:33,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:33,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:33,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-18 13:19:33,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:33,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094973770] [2019-12-18 13:19:33,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:33,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094973770] [2019-12-18 13:19:33,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:33,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891912378] [2019-12-18 13:19:33,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:33,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:33,682 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-18 13:19:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:34,391 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-18 13:19:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:34,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:34,858 INFO L225 Difference]: With dead ends: 63360 [2019-12-18 13:19:34,858 INFO L226 Difference]: Without dead ends: 63353 [2019-12-18 13:19:34,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-18 13:19:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-18 13:19:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-18 13:19:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-18 13:19:35,707 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-18 13:19:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:35,708 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-18 13:19:35,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-18 13:19:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:19:35,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:35,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:35,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-18 13:19:35,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:35,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027294082] [2019-12-18 13:19:35,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:35,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027294082] [2019-12-18 13:19:35,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:35,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:35,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006609465] [2019-12-18 13:19:35,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:35,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:35,782 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-18 13:19:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:35,882 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-18 13:19:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:19:35,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:19:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:35,924 INFO L225 Difference]: With dead ends: 18121 [2019-12-18 13:19:35,924 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 13:19:35,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 13:19:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-18 13:19:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-18 13:19:36,223 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-18 13:19:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:36,223 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-18 13:19:36,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-18 13:19:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:36,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:36,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:36,237 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-18 13:19:36,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:36,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433014307] [2019-12-18 13:19:36,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:36,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433014307] [2019-12-18 13:19:36,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:36,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:36,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263124490] [2019-12-18 13:19:36,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:36,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:36,280 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-18 13:19:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:36,378 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-18 13:19:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:36,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:19:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:36,408 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 13:19:36,408 INFO L226 Difference]: Without dead ends: 23499 [2019-12-18 13:19:36,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-18 13:19:36,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-18 13:19:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-18 13:19:36,714 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-18 13:19:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:36,715 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-18 13:19:36,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-18 13:19:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:36,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:36,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:36,728 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:36,728 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-18 13:19:36,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:36,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351461926] [2019-12-18 13:19:36,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:36,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351461926] [2019-12-18 13:19:36,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:36,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:36,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905466269] [2019-12-18 13:19:36,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:36,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:36,802 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-18 13:19:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:37,285 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-18 13:19:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:37,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:19:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:37,325 INFO L225 Difference]: With dead ends: 21964 [2019-12-18 13:19:37,325 INFO L226 Difference]: Without dead ends: 21964 [2019-12-18 13:19:37,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-18 13:19:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-18 13:19:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-18 13:19:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-18 13:19:37,650 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-18 13:19:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:37,650 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-18 13:19:37,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-18 13:19:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:19:37,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:37,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:37,665 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-18 13:19:37,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:37,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249866573] [2019-12-18 13:19:37,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:37,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249866573] [2019-12-18 13:19:37,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:37,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:19:37,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133811996] [2019-12-18 13:19:37,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:37,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:37,775 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-18 13:19:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:37,936 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-18 13:19:37,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:37,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:19:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:37,962 INFO L225 Difference]: With dead ends: 20911 [2019-12-18 13:19:37,962 INFO L226 Difference]: Without dead ends: 20911 [2019-12-18 13:19:37,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-18 13:19:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-18 13:19:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-18 13:19:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-18 13:19:38,271 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-18 13:19:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:38,272 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-18 13:19:38,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-18 13:19:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:19:38,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:38,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:38,288 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-18 13:19:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:38,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345872334] [2019-12-18 13:19:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:38,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345872334] [2019-12-18 13:19:38,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:38,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:38,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373027520] [2019-12-18 13:19:38,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:38,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:38,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:38,380 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-18 13:19:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:38,779 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-18 13:19:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:38,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 13:19:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:38,816 INFO L225 Difference]: With dead ends: 24383 [2019-12-18 13:19:38,816 INFO L226 Difference]: Without dead ends: 24383 [2019-12-18 13:19:38,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-18 13:19:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-18 13:19:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-18 13:19:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-18 13:19:39,151 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-18 13:19:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:39,151 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-18 13:19:39,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-18 13:19:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:19:39,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:39,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:39,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:39,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-18 13:19:39,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:39,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960321391] [2019-12-18 13:19:39,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:39,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960321391] [2019-12-18 13:19:39,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:39,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:39,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320378980] [2019-12-18 13:19:39,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:39,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:39,267 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-18 13:19:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:40,014 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-18 13:19:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:40,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:19:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:40,050 INFO L225 Difference]: With dead ends: 27860 [2019-12-18 13:19:40,050 INFO L226 Difference]: Without dead ends: 27860 [2019-12-18 13:19:40,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-18 13:19:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-18 13:19:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-18 13:19:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-18 13:19:40,554 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-18 13:19:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:40,555 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-18 13:19:40,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-18 13:19:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:19:40,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:40,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:40,573 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-18 13:19:40,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:40,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448176279] [2019-12-18 13:19:40,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:40,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448176279] [2019-12-18 13:19:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355993020] [2019-12-18 13:19:40,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:40,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:40,659 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-18 13:19:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:41,563 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-18 13:19:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:41,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 13:19:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:41,624 INFO L225 Difference]: With dead ends: 27029 [2019-12-18 13:19:41,624 INFO L226 Difference]: Without dead ends: 27029 [2019-12-18 13:19:41,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-18 13:19:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-18 13:19:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-18 13:19:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-18 13:19:42,131 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-18 13:19:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:42,132 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-18 13:19:42,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-18 13:19:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:19:42,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:42,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:42,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-18 13:19:42,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:42,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318213941] [2019-12-18 13:19:42,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:42,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318213941] [2019-12-18 13:19:42,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:42,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:19:42,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140524517] [2019-12-18 13:19:42,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:42,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:42,199 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-18 13:19:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:42,278 INFO L93 Difference]: Finished difference Result 19089 states and 56685 transitions. [2019-12-18 13:19:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:42,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:19:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:42,310 INFO L225 Difference]: With dead ends: 19089 [2019-12-18 13:19:42,310 INFO L226 Difference]: Without dead ends: 19089 [2019-12-18 13:19:42,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19089 states. [2019-12-18 13:19:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19089 to 19089. [2019-12-18 13:19:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19089 states. [2019-12-18 13:19:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 56685 transitions. [2019-12-18 13:19:42,600 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 56685 transitions. Word has length 39 [2019-12-18 13:19:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:42,600 INFO L462 AbstractCegarLoop]: Abstraction has 19089 states and 56685 transitions. [2019-12-18 13:19:42,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 56685 transitions. [2019-12-18 13:19:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:19:42,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:42,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:42,629 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-18 13:19:42,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:42,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875829440] [2019-12-18 13:19:42,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875829440] [2019-12-18 13:19:42,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:42,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:42,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437550800] [2019-12-18 13:19:42,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:42,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:42,681 INFO L87 Difference]: Start difference. First operand 19089 states and 56685 transitions. Second operand 5 states. [2019-12-18 13:19:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:42,766 INFO L93 Difference]: Finished difference Result 17863 states and 53949 transitions. [2019-12-18 13:19:42,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:42,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:19:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:42,789 INFO L225 Difference]: With dead ends: 17863 [2019-12-18 13:19:42,789 INFO L226 Difference]: Without dead ends: 17863 [2019-12-18 13:19:42,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17863 states. [2019-12-18 13:19:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17863 to 17282. [2019-12-18 13:19:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17282 states. [2019-12-18 13:19:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17282 states to 17282 states and 52380 transitions. [2019-12-18 13:19:43,067 INFO L78 Accepts]: Start accepts. Automaton has 17282 states and 52380 transitions. Word has length 40 [2019-12-18 13:19:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:43,067 INFO L462 AbstractCegarLoop]: Abstraction has 17282 states and 52380 transitions. [2019-12-18 13:19:43,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17282 states and 52380 transitions. [2019-12-18 13:19:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:19:43,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:43,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:43,086 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:43,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1686455793, now seen corresponding path program 1 times [2019-12-18 13:19:43,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:43,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129394964] [2019-12-18 13:19:43,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:43,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129394964] [2019-12-18 13:19:43,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:43,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:43,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217402470] [2019-12-18 13:19:43,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:43,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:43,162 INFO L87 Difference]: Start difference. First operand 17282 states and 52380 transitions. Second operand 7 states. [2019-12-18 13:19:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:43,985 INFO L93 Difference]: Finished difference Result 48878 states and 146807 transitions. [2019-12-18 13:19:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:43,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:19:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:44,046 INFO L225 Difference]: With dead ends: 48878 [2019-12-18 13:19:44,046 INFO L226 Difference]: Without dead ends: 37801 [2019-12-18 13:19:44,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:19:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37801 states. [2019-12-18 13:19:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37801 to 20547. [2019-12-18 13:19:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20547 states. [2019-12-18 13:19:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20547 states to 20547 states and 62430 transitions. [2019-12-18 13:19:44,476 INFO L78 Accepts]: Start accepts. Automaton has 20547 states and 62430 transitions. Word has length 64 [2019-12-18 13:19:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:44,477 INFO L462 AbstractCegarLoop]: Abstraction has 20547 states and 62430 transitions. [2019-12-18 13:19:44,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 20547 states and 62430 transitions. [2019-12-18 13:19:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:19:44,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:44,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:44,504 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash -524205917, now seen corresponding path program 2 times [2019-12-18 13:19:44,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:44,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208641906] [2019-12-18 13:19:44,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:44,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208641906] [2019-12-18 13:19:44,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:44,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:44,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011971085] [2019-12-18 13:19:44,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:44,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:44,584 INFO L87 Difference]: Start difference. First operand 20547 states and 62430 transitions. Second operand 7 states. [2019-12-18 13:19:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:45,132 INFO L93 Difference]: Finished difference Result 57101 states and 169539 transitions. [2019-12-18 13:19:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:45,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:19:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:45,185 INFO L225 Difference]: With dead ends: 57101 [2019-12-18 13:19:45,185 INFO L226 Difference]: Without dead ends: 41504 [2019-12-18 13:19:45,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:19:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41504 states. [2019-12-18 13:19:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41504 to 24071. [2019-12-18 13:19:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24071 states. [2019-12-18 13:19:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24071 states to 24071 states and 72796 transitions. [2019-12-18 13:19:45,696 INFO L78 Accepts]: Start accepts. Automaton has 24071 states and 72796 transitions. Word has length 64 [2019-12-18 13:19:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:45,696 INFO L462 AbstractCegarLoop]: Abstraction has 24071 states and 72796 transitions. [2019-12-18 13:19:45,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24071 states and 72796 transitions. [2019-12-18 13:19:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:19:45,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:45,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:45,722 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -817795821, now seen corresponding path program 3 times [2019-12-18 13:19:45,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:45,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554063771] [2019-12-18 13:19:45,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554063771] [2019-12-18 13:19:45,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:45,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809826450] [2019-12-18 13:19:45,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:45,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:45,802 INFO L87 Difference]: Start difference. First operand 24071 states and 72796 transitions. Second operand 7 states. [2019-12-18 13:19:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:46,255 INFO L93 Difference]: Finished difference Result 46576 states and 138774 transitions. [2019-12-18 13:19:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:19:46,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:19:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:46,313 INFO L225 Difference]: With dead ends: 46576 [2019-12-18 13:19:46,313 INFO L226 Difference]: Without dead ends: 43865 [2019-12-18 13:19:46,313 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-18 13:19:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43865 states. [2019-12-18 13:19:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43865 to 24167. [2019-12-18 13:19:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24167 states. [2019-12-18 13:19:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 73140 transitions. [2019-12-18 13:19:47,033 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 73140 transitions. Word has length 64 [2019-12-18 13:19:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:47,034 INFO L462 AbstractCegarLoop]: Abstraction has 24167 states and 73140 transitions. [2019-12-18 13:19:47,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 73140 transitions. [2019-12-18 13:19:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:19:47,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:47,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:47,057 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1121509405, now seen corresponding path program 4 times [2019-12-18 13:19:47,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:47,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096196049] [2019-12-18 13:19:47,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:47,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096196049] [2019-12-18 13:19:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:47,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:47,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584698810] [2019-12-18 13:19:47,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:47,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:47,129 INFO L87 Difference]: Start difference. First operand 24167 states and 73140 transitions. Second operand 3 states. [2019-12-18 13:19:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:47,280 INFO L93 Difference]: Finished difference Result 28079 states and 84632 transitions. [2019-12-18 13:19:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:47,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:19:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:47,316 INFO L225 Difference]: With dead ends: 28079 [2019-12-18 13:19:47,316 INFO L226 Difference]: Without dead ends: 28079 [2019-12-18 13:19:47,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28079 states. [2019-12-18 13:19:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28079 to 24805. [2019-12-18 13:19:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-18 13:19:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 75036 transitions. [2019-12-18 13:19:47,714 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 75036 transitions. Word has length 64 [2019-12-18 13:19:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:47,714 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 75036 transitions. [2019-12-18 13:19:47,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 75036 transitions. [2019-12-18 13:19:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:47,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:47,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:47,749 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash -788205559, now seen corresponding path program 1 times [2019-12-18 13:19:47,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:47,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54149220] [2019-12-18 13:19:47,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:47,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54149220] [2019-12-18 13:19:47,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:47,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:47,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216258725] [2019-12-18 13:19:47,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:47,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:47,837 INFO L87 Difference]: Start difference. First operand 24805 states and 75036 transitions. Second operand 3 states. [2019-12-18 13:19:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:47,964 INFO L93 Difference]: Finished difference Result 24805 states and 75035 transitions. [2019-12-18 13:19:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:47,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:19:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:48,010 INFO L225 Difference]: With dead ends: 24805 [2019-12-18 13:19:48,010 INFO L226 Difference]: Without dead ends: 24805 [2019-12-18 13:19:48,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24805 states. [2019-12-18 13:19:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24805 to 21139. [2019-12-18 13:19:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21139 states. [2019-12-18 13:19:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 64818 transitions. [2019-12-18 13:19:48,451 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 64818 transitions. Word has length 65 [2019-12-18 13:19:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:48,452 INFO L462 AbstractCegarLoop]: Abstraction has 21139 states and 64818 transitions. [2019-12-18 13:19:48,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 64818 transitions. [2019-12-18 13:19:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:19:48,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:48,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:48,472 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-18 13:19:48,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:48,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303303697] [2019-12-18 13:19:48,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:48,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303303697] [2019-12-18 13:19:48,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:48,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:48,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463541437] [2019-12-18 13:19:48,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:48,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:48,550 INFO L87 Difference]: Start difference. First operand 21139 states and 64818 transitions. Second operand 3 states. [2019-12-18 13:19:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:48,644 INFO L93 Difference]: Finished difference Result 17624 states and 52955 transitions. [2019-12-18 13:19:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:48,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:19:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:48,675 INFO L225 Difference]: With dead ends: 17624 [2019-12-18 13:19:48,676 INFO L226 Difference]: Without dead ends: 17624 [2019-12-18 13:19:48,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17624 states. [2019-12-18 13:19:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17624 to 16192. [2019-12-18 13:19:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16192 states. [2019-12-18 13:19:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16192 states to 16192 states and 48657 transitions. [2019-12-18 13:19:48,967 INFO L78 Accepts]: Start accepts. Automaton has 16192 states and 48657 transitions. Word has length 66 [2019-12-18 13:19:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:48,967 INFO L462 AbstractCegarLoop]: Abstraction has 16192 states and 48657 transitions. [2019-12-18 13:19:48,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 16192 states and 48657 transitions. [2019-12-18 13:19:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:48,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:48,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:48,982 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:48,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-18 13:19:48,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:48,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840880147] [2019-12-18 13:19:48,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:49,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840880147] [2019-12-18 13:19:49,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:49,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:19:49,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877919720] [2019-12-18 13:19:49,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:19:49,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:49,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:19:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:19:49,403 INFO L87 Difference]: Start difference. First operand 16192 states and 48657 transitions. Second operand 15 states. [2019-12-18 13:19:50,149 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-18 13:19:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:54,565 INFO L93 Difference]: Finished difference Result 41868 states and 122933 transitions. [2019-12-18 13:19:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 13:19:54,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 13:19:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:54,613 INFO L225 Difference]: With dead ends: 41868 [2019-12-18 13:19:54,613 INFO L226 Difference]: Without dead ends: 34882 [2019-12-18 13:19:54,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=633, Invalid=3527, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 13:19:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34882 states. [2019-12-18 13:19:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34882 to 17613. [2019-12-18 13:19:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17613 states. [2019-12-18 13:19:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17613 states to 17613 states and 52688 transitions. [2019-12-18 13:19:54,994 INFO L78 Accepts]: Start accepts. Automaton has 17613 states and 52688 transitions. Word has length 67 [2019-12-18 13:19:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:54,995 INFO L462 AbstractCegarLoop]: Abstraction has 17613 states and 52688 transitions. [2019-12-18 13:19:54,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:19:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17613 states and 52688 transitions. [2019-12-18 13:19:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:55,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:55,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:55,012 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 426570281, now seen corresponding path program 2 times [2019-12-18 13:19:55,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943769519] [2019-12-18 13:19:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:55,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-18 13:19:55,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943769519] [2019-12-18 13:19:55,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:55,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:19:55,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113195092] [2019-12-18 13:19:55,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:19:55,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:19:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:19:55,190 INFO L87 Difference]: Start difference. First operand 17613 states and 52688 transitions. Second operand 10 states. [2019-12-18 13:19:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:56,353 INFO L93 Difference]: Finished difference Result 40227 states and 119135 transitions. [2019-12-18 13:19:56,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 13:19:56,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:19:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:56,396 INFO L225 Difference]: With dead ends: 40227 [2019-12-18 13:19:56,396 INFO L226 Difference]: Without dead ends: 31020 [2019-12-18 13:19:56,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:19:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31020 states. [2019-12-18 13:19:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31020 to 17394. [2019-12-18 13:19:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17394 states. [2019-12-18 13:19:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17394 states to 17394 states and 51851 transitions. [2019-12-18 13:19:56,999 INFO L78 Accepts]: Start accepts. Automaton has 17394 states and 51851 transitions. Word has length 67 [2019-12-18 13:19:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:57,000 INFO L462 AbstractCegarLoop]: Abstraction has 17394 states and 51851 transitions. [2019-12-18 13:19:57,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:19:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17394 states and 51851 transitions. [2019-12-18 13:19:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:57,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:57,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:57,019 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:19:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2051549039, now seen corresponding path program 3 times [2019-12-18 13:19:57,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:57,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146891910] [2019-12-18 13:19:57,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:57,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146891910] [2019-12-18 13:19:57,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:57,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:19:57,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365092663] [2019-12-18 13:19:57,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:19:57,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:19:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:19:57,460 INFO L87 Difference]: Start difference. First operand 17394 states and 51851 transitions. Second operand 16 states. [2019-12-18 13:20:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:01,933 INFO L93 Difference]: Finished difference Result 37964 states and 111394 transitions. [2019-12-18 13:20:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 13:20:01,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:20:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:01,980 INFO L225 Difference]: With dead ends: 37964 [2019-12-18 13:20:01,980 INFO L226 Difference]: Without dead ends: 34893 [2019-12-18 13:20:01,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=2775, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 13:20:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34893 states. [2019-12-18 13:20:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34893 to 17448. [2019-12-18 13:20:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17448 states. [2019-12-18 13:20:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17448 states to 17448 states and 51977 transitions. [2019-12-18 13:20:02,369 INFO L78 Accepts]: Start accepts. Automaton has 17448 states and 51977 transitions. Word has length 67 [2019-12-18 13:20:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:02,370 INFO L462 AbstractCegarLoop]: Abstraction has 17448 states and 51977 transitions. [2019-12-18 13:20:02,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:20:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17448 states and 51977 transitions. [2019-12-18 13:20:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:20:02,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:02,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:02,388 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:20:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1595697243, now seen corresponding path program 4 times [2019-12-18 13:20:02,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:02,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986798743] [2019-12-18 13:20:02,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:20:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:20:02,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986798743] [2019-12-18 13:20:02,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:20:02,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:20:02,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790469100] [2019-12-18 13:20:02,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:20:02,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:20:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:20:02,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:20:02,533 INFO L87 Difference]: Start difference. First operand 17448 states and 51977 transitions. Second operand 11 states. [2019-12-18 13:20:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:20:03,724 INFO L93 Difference]: Finished difference Result 34368 states and 101852 transitions. [2019-12-18 13:20:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:20:03,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:20:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:20:03,765 INFO L225 Difference]: With dead ends: 34368 [2019-12-18 13:20:03,765 INFO L226 Difference]: Without dead ends: 29881 [2019-12-18 13:20:03,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:20:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29881 states. [2019-12-18 13:20:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29881 to 16492. [2019-12-18 13:20:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-12-18 13:20:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 49209 transitions. [2019-12-18 13:20:04,263 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 49209 transitions. Word has length 67 [2019-12-18 13:20:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:20:04,263 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 49209 transitions. [2019-12-18 13:20:04,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:20:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 49209 transitions. [2019-12-18 13:20:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:20:04,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:20:04,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:20:04,280 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:20:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:20:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 5 times [2019-12-18 13:20:04,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:20:04,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868384240] [2019-12-18 13:20:04,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:20:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:20:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:20:04,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:20:04,407 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:20:04,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= |v_ULTIMATE.start_main_~#t925~0.offset_22| 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30| 1) |v_#valid_67|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30|) 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30|) |v_ULTIMATE.start_main_~#t925~0.offset_22| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t925~0.base_30| 4)) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t925~0.base_30|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ULTIMATE.start_main_~#t925~0.base=|v_ULTIMATE.start_main_~#t925~0.base_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t925~0.offset=|v_ULTIMATE.start_main_~#t925~0.offset_22|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t926~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t926~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t927~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t925~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t927~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t925~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:20:04,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-156677204)) (= ~a$r_buff0_thd1~0_In-156677204 ~a$r_buff1_thd1~0_Out-156677204) (= ~a$r_buff0_thd2~0_In-156677204 ~a$r_buff1_thd2~0_Out-156677204) (= 1 ~a$r_buff0_thd1~0_Out-156677204) (= ~a$r_buff0_thd0~0_In-156677204 ~a$r_buff1_thd0~0_Out-156677204) (= ~x~0_In-156677204 ~__unbuffered_p0_EAX~0_Out-156677204) (= ~a$r_buff1_thd3~0_Out-156677204 ~a$r_buff0_thd3~0_In-156677204)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-156677204, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-156677204, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-156677204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-156677204, ~x~0=~x~0_In-156677204} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-156677204, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-156677204, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-156677204, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-156677204, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-156677204, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-156677204, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-156677204, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-156677204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-156677204, ~x~0=~x~0_In-156677204} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:20:04,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11|) |v_ULTIMATE.start_main_~#t926~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t926~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t926~0.base_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t926~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t926~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_10|, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t926~0.offset, ULTIMATE.start_main_~#t926~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:20:04,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_ULTIMATE.start_main_~#t927~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t927~0.base_11|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t927~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t927~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11|) |v_ULTIMATE.start_main_~#t927~0.offset_10| 2))) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_11|, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t927~0.base, ULTIMATE.start_main_~#t927~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 13:20:04,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-2022006577 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2022006577 256)))) (or (and (= ~a~0_In-2022006577 |P1Thread1of1ForFork2_#t~ite9_Out-2022006577|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-2022006577 |P1Thread1of1ForFork2_#t~ite9_Out-2022006577|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-2022006577, ~a$w_buff1~0=~a$w_buff1~0_In-2022006577, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2022006577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2022006577} OutVars{~a~0=~a~0_In-2022006577, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2022006577|, ~a$w_buff1~0=~a$w_buff1~0_In-2022006577, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2022006577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2022006577} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:20:04,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:20:04,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-733221519 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-733221519 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-733221519|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-733221519| ~a$w_buff0_used~0_In-733221519) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-733221519, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-733221519} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-733221519, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-733221519, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-733221519|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:20:04,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-430032497 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-430032497 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-430032497 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-430032497 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-430032497|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-430032497 |P1Thread1of1ForFork2_#t~ite12_Out-430032497|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-430032497, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-430032497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430032497, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430032497} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-430032497, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-430032497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430032497, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-430032497|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430032497} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:20:04,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1391545840 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1391545840 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In1391545840 |P1Thread1of1ForFork2_#t~ite13_Out1391545840|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1391545840|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1391545840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1391545840} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1391545840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1391545840, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1391545840|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:20:04,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1089374552 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1089374552 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1089374552 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1089374552 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1089374552| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1089374552| ~a$r_buff1_thd2~0_In-1089374552) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1089374552, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1089374552, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1089374552, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1089374552} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1089374552, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1089374552, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1089374552, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1089374552, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1089374552|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:20:04,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:20:04,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1570075152 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1570075152 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1570075152| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1570075152 |P0Thread1of1ForFork1_#t~ite5_Out1570075152|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1570075152, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1570075152} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1570075152|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1570075152, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1570075152} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:20:04,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1397763898 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1397763898 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1397763898 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1397763898 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1397763898 |P0Thread1of1ForFork1_#t~ite6_Out1397763898|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1397763898|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1397763898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1397763898, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1397763898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1397763898} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1397763898|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1397763898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1397763898, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1397763898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1397763898} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:20:04,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1136653629 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1136653629 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1136653629)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-1136653629 ~a$r_buff0_thd1~0_Out-1136653629)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136653629, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1136653629} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1136653629|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1136653629, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1136653629} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:20:04,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In96399663 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In96399663 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In96399663 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In96399663 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In96399663 |P0Thread1of1ForFork1_#t~ite8_Out96399663|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out96399663|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In96399663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In96399663, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In96399663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In96399663} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out96399663|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In96399663, ~a$w_buff0_used~0=~a$w_buff0_used~0_In96399663, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In96399663, ~a$w_buff1_used~0=~a$w_buff1_used~0_In96399663} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:20:04,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:20:04,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1593018110 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out1593018110| |P2Thread1of1ForFork0_#t~ite29_Out1593018110|) (= |P2Thread1of1ForFork0_#t~ite29_Out1593018110| ~a$w_buff1_used~0_In1593018110) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1593018110 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1593018110 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In1593018110 256)) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In1593018110 256)) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite30_Out1593018110| ~a$w_buff1_used~0_In1593018110) (= |P2Thread1of1ForFork0_#t~ite29_In1593018110| |P2Thread1of1ForFork0_#t~ite29_Out1593018110|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1593018110, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1593018110, ~weak$$choice2~0=~weak$$choice2~0_In1593018110, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1593018110|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1593018110, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1593018110, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1593018110|, ~weak$$choice2~0=~weak$$choice2~0_In1593018110, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1593018110|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 13:20:04,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:20:04,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:20:04,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In804853791 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In804853791 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out804853791| ~a~0_In804853791)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out804853791| ~a$w_buff1~0_In804853791) (not .cse0)))) InVars {~a~0=~a~0_In804853791, ~a$w_buff1~0=~a$w_buff1~0_In804853791, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In804853791, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804853791} OutVars{~a~0=~a~0_In804853791, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out804853791|, ~a$w_buff1~0=~a$w_buff1~0_In804853791, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In804853791, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804853791} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:20:04,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:20:04,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1261142528 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1261142528 256)))) (or (and (= ~a$w_buff0_used~0_In1261142528 |P2Thread1of1ForFork0_#t~ite40_Out1261142528|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1261142528|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1261142528, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1261142528} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1261142528|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1261142528, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1261142528} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:20:04,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1341385689 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1341385689 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1341385689 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1341385689 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1341385689|)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1341385689| ~a$w_buff1_used~0_In-1341385689) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1341385689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1341385689, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1341385689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1341385689} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1341385689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1341385689, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1341385689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1341385689, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1341385689|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:20:04,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-537178692 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-537178692 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-537178692| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-537178692| ~a$r_buff0_thd3~0_In-537178692) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-537178692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-537178692} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-537178692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-537178692, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-537178692|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:20:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In923623615 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In923623615 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In923623615 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In923623615 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out923623615| ~a$r_buff1_thd3~0_In923623615) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out923623615| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In923623615, ~a$w_buff0_used~0=~a$w_buff0_used~0_In923623615, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In923623615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In923623615} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out923623615|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In923623615, ~a$w_buff0_used~0=~a$w_buff0_used~0_In923623615, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In923623615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In923623615} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:20:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:20:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:20:04,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-650145266| |ULTIMATE.start_main_#t~ite48_Out-650145266|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-650145266 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-650145266 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-650145266| ~a~0_In-650145266) (or .cse1 .cse2)) (and .cse0 (= ~a$w_buff1~0_In-650145266 |ULTIMATE.start_main_#t~ite47_Out-650145266|) (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In-650145266, ~a$w_buff1~0=~a$w_buff1~0_In-650145266, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-650145266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-650145266} OutVars{~a~0=~a~0_In-650145266, ~a$w_buff1~0=~a$w_buff1~0_In-650145266, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-650145266|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-650145266, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-650145266|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-650145266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:20:04,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1320102238 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1320102238 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1320102238|)) (and (= ~a$w_buff0_used~0_In-1320102238 |ULTIMATE.start_main_#t~ite49_Out-1320102238|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1320102238, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1320102238} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1320102238, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1320102238|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1320102238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:20:04,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In490583400 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In490583400 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In490583400 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In490583400 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out490583400|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In490583400 |ULTIMATE.start_main_#t~ite50_Out490583400|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In490583400, ~a$w_buff0_used~0=~a$w_buff0_used~0_In490583400, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In490583400, ~a$w_buff1_used~0=~a$w_buff1_used~0_In490583400} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out490583400|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In490583400, ~a$w_buff0_used~0=~a$w_buff0_used~0_In490583400, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In490583400, ~a$w_buff1_used~0=~a$w_buff1_used~0_In490583400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:20:04,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2084084457 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2084084457 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-2084084457 |ULTIMATE.start_main_#t~ite51_Out-2084084457|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2084084457|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2084084457, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084084457} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2084084457|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2084084457, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084084457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:20:04,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-755884683 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-755884683 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-755884683 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-755884683 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-755884683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-755884683| ~a$r_buff1_thd0~0_In-755884683) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-755884683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-755884683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-755884683} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-755884683|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-755884683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-755884683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-755884683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:20:04,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:20:04,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:20:04 BasicIcfg [2019-12-18 13:20:04,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:20:04,555 INFO L168 Benchmark]: Toolchain (without parser) took 104780.42 ms. Allocated memory was 138.9 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,565 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.17 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 154.2 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.53 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,567 INFO L168 Benchmark]: Boogie Preprocessor took 40.26 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,567 INFO L168 Benchmark]: RCFGBuilder took 878.51 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 98.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,570 INFO L168 Benchmark]: TraceAbstraction took 102999.13 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:20:04,572 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.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.17 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 154.2 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.53 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.26 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.51 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 98.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102999.13 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t925, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t926, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t927, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6687 SDtfs, 8147 SDslu, 22736 SDs, 0 SdLazy, 12057 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 33 SyntacticMatches, 19 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2595 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred 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: 41.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 223549 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1124 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 243058 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...