/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:09:59,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:09:59,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:09:59,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:09:59,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:09:59,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:09:59,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:09:59,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:09:59,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:09:59,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:09:59,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:09:59,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:09:59,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:09:59,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:09:59,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:09:59,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:09:59,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:09:59,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:09:59,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:09:59,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:09:59,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:09:59,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:09:59,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:09:59,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:09:59,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:09:59,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:09:59,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:09:59,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:09:59,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:09:59,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:09:59,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:09:59,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:09:59,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:09:59,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:09:59,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:09:59,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:09:59,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:09:59,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:09:59,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:09:59,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:09:59,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:09:59,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:09:59,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:09:59,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:09:59,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:09:59,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:09:59,505 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:09:59,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:09:59,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:09:59,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:09:59,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:09:59,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:09:59,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:09:59,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:09:59,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:09:59,508 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:09:59,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:09:59,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:09:59,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:09:59,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:09:59,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:09:59,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:09:59,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:09:59,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:09:59,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:09:59,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:09:59,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:09:59,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:09:59,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:09:59,511 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:09:59,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:09:59,511 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:09:59,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:09:59,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:09:59,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:09:59,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:09:59,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:09:59,830 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:09:59,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 18:09:59,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caafb9c6/c38d6d1190e84b949916978a60cc6527/FLAGc0c4d1fb5 [2019-12-27 18:10:00,474 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:10:00,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.oepc.i [2019-12-27 18:10:00,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caafb9c6/c38d6d1190e84b949916978a60cc6527/FLAGc0c4d1fb5 [2019-12-27 18:10:00,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7caafb9c6/c38d6d1190e84b949916978a60cc6527 [2019-12-27 18:10:00,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:10:00,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:10:00,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:10:00,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:10:00,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:10:00,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:10:00" (1/1) ... [2019-12-27 18:10:00,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e18a570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:00, skipping insertion in model container [2019-12-27 18:10:00,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:10:00" (1/1) ... [2019-12-27 18:10:00,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:10:00,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:10:01,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:10:01,417 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:10:01,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:10:01,569 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:10:01,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01 WrapperNode [2019-12-27 18:10:01,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:10:01,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:10:01,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:10:01,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:10:01,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:10:01,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:10:01,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:10:01,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:10:01,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... [2019-12-27 18:10:01,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:10:01,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:10:01,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:10:01,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:10:01,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:10:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:10:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:10:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:10:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:10:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:10:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:10:01,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:10:01,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:10:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:10:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:10:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:10:01,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:10:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:10:01,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-27 18:10:02,511 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:10:02,512 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:10:02,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:10:02 BoogieIcfgContainer [2019-12-27 18:10:02,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:10:02,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:10:02,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:10:02,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:10:02,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:10:00" (1/3) ... [2019-12-27 18:10:02,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:10:02, skipping insertion in model container [2019-12-27 18:10:02,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:01" (2/3) ... [2019-12-27 18:10:02,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:10:02, skipping insertion in model container [2019-12-27 18:10:02,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:10:02" (3/3) ... [2019-12-27 18:10:02,522 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.oepc.i [2019-12-27 18:10:02,530 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:10:02,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:10:02,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:10:02,538 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:10:02,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:02,643 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:10:02,658 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:10:02,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:10:02,659 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:10:02,659 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:10:02,659 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:10:02,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:10:02,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:10:02,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:10:02,676 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:10:02,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:10:02,780 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:10:02,780 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:10:02,796 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:10:02,821 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:10:02,872 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:10:02,872 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:10:02,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:10:02,899 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:10:02,900 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:10:07,636 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 18:10:07,753 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 18:10:08,045 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:10:08,173 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:10:08,203 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-27 18:10:08,203 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:10:08,207 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 18:10:26,655 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 18:10:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 18:10:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:10:26,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:26,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:10:26,664 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-27 18:10:26,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:26,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756227478] [2019-12-27 18:10:26,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:26,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756227478] [2019-12-27 18:10:26,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:26,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:10:26,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496887027] [2019-12-27 18:10:26,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:26,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:27,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:10:27,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:27,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:27,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:10:27,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:10:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:27,023 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 18:10:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:28,008 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-27 18:10:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:10:28,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:10:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:31,875 INFO L225 Difference]: With dead ends: 115182 [2019-12-27 18:10:31,876 INFO L226 Difference]: Without dead ends: 112830 [2019-12-27 18:10:31,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-27 18:10:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-27 18:10:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-27 18:10:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-27 18:10:38,784 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-27 18:10:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:38,784 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-27 18:10:38,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:10:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-27 18:10:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:10:38,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:38,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:10:38,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-27 18:10:38,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:38,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436799129] [2019-12-27 18:10:38,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:38,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436799129] [2019-12-27 18:10:38,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:38,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:10:38,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079986060] [2019-12-27 18:10:38,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:38,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:38,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:10:38,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:38,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:38,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:10:38,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:10:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:10:38,933 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-27 18:10:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:44,239 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-27 18:10:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:10:44,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:10:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:44,863 INFO L225 Difference]: With dead ends: 176302 [2019-12-27 18:10:44,863 INFO L226 Difference]: Without dead ends: 176253 [2019-12-27 18:10:44,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:10:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-27 18:10:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-27 18:10:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-27 18:11:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-27 18:11:01,272 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-27 18:11:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:01,273 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-27 18:11:01,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-27 18:11:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:11:01,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:01,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:01,281 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-27 18:11:01,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:01,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222499449] [2019-12-27 18:11:01,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:01,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222499449] [2019-12-27 18:11:01,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:01,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:01,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304376541] [2019-12-27 18:11:01,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:01,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:01,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:11:01,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:01,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:01,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:11:01,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:11:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:01,374 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-27 18:11:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:10,029 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-27 18:11:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:11:10,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:11:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:10,919 INFO L225 Difference]: With dead ends: 228428 [2019-12-27 18:11:10,919 INFO L226 Difference]: Without dead ends: 228365 [2019-12-27 18:11:10,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-27 18:11:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-27 18:11:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-27 18:11:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-27 18:11:20,989 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-27 18:11:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:20,990 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-27 18:11:20,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-27 18:11:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:11:20,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:20,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:20,994 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-27 18:11:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:20,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035895928] [2019-12-27 18:11:20,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:21,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035895928] [2019-12-27 18:11:21,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:21,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:21,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169482757] [2019-12-27 18:11:21,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:21,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:21,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:11:21,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:21,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:21,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:21,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:21,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:21,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:21,048 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-27 18:11:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:21,187 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-27 18:11:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:21,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:11:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:21,246 INFO L225 Difference]: With dead ends: 38255 [2019-12-27 18:11:21,246 INFO L226 Difference]: Without dead ends: 38255 [2019-12-27 18:11:21,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-27 18:11:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-27 18:11:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-27 18:11:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-27 18:11:23,235 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-27 18:11:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:23,236 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-27 18:11:23,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-27 18:11:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:11:23,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:23,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:23,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-27 18:11:23,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:23,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380078293] [2019-12-27 18:11:23,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:23,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380078293] [2019-12-27 18:11:23,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:23,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:23,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955741842] [2019-12-27 18:11:23,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:23,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:23,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 18:11:23,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:23,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:23,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:23,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:23,344 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-27 18:11:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:24,068 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-27 18:11:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:11:24,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:11:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:24,148 INFO L225 Difference]: With dead ends: 51712 [2019-12-27 18:11:24,148 INFO L226 Difference]: Without dead ends: 51699 [2019-12-27 18:11:24,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:11:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-27 18:11:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-27 18:11:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-27 18:11:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-27 18:11:24,865 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-27 18:11:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:24,866 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-27 18:11:24,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-27 18:11:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:11:24,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:24,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:24,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-27 18:11:24,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:24,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705505932] [2019-12-27 18:11:24,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:24,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705505932] [2019-12-27 18:11:24,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:24,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:24,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062457589] [2019-12-27 18:11:24,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:24,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:24,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:11:24,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:24,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:24,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:11:24,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:11:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:24,955 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-27 18:11:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:24,998 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-27 18:11:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:11:24,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:11:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:25,009 INFO L225 Difference]: With dead ends: 7422 [2019-12-27 18:11:25,010 INFO L226 Difference]: Without dead ends: 7422 [2019-12-27 18:11:25,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-27 18:11:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-27 18:11:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-27 18:11:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-27 18:11:25,112 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-27 18:11:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:25,112 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-27 18:11:25,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-27 18:11:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:11:25,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:25,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:25,124 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-27 18:11:25,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:25,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840593768] [2019-12-27 18:11:25,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:25,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840593768] [2019-12-27 18:11:25,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:25,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:11:25,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79292101] [2019-12-27 18:11:25,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:25,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:25,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 18:11:25,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:25,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:11:25,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:25,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:25,543 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-27 18:11:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:25,582 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 18:11:25,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:11:25,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:11:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:25,591 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 18:11:25,591 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 18:11:25,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 18:11:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 18:11:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 18:11:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 18:11:25,666 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 18:11:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:25,666 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 18:11:25,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 18:11:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:25,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:25,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-27 18:11:25,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:25,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411578427] [2019-12-27 18:11:25,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:25,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411578427] [2019-12-27 18:11:25,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:25,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:25,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159439876] [2019-12-27 18:11:25,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:25,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:25,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 18:11:25,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:26,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:11:26,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:11:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:11:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:11:26,148 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 10 states. [2019-12-27 18:11:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:26,786 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-27 18:11:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:26,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 18:11:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:26,798 INFO L225 Difference]: With dead ends: 7539 [2019-12-27 18:11:26,798 INFO L226 Difference]: Without dead ends: 7539 [2019-12-27 18:11:26,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:11:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-27 18:11:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-27 18:11:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-27 18:11:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-27 18:11:26,899 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-27 18:11:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:26,899 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-27 18:11:26,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:11:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-27 18:11:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:26,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:26,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:26,909 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-27 18:11:26,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:26,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027692276] [2019-12-27 18:11:26,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:27,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027692276] [2019-12-27 18:11:27,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:27,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:27,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [645470785] [2019-12-27 18:11:27,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:27,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:27,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 18:11:27,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:27,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:11:27,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:27,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:27,257 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-27 18:11:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:27,304 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-27 18:11:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:27,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:11:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:27,316 INFO L225 Difference]: With dead ends: 5975 [2019-12-27 18:11:27,316 INFO L226 Difference]: Without dead ends: 5975 [2019-12-27 18:11:27,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-27 18:11:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-27 18:11:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-27 18:11:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-27 18:11:27,435 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-27 18:11:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:27,436 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-27 18:11:27,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-27 18:11:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:27,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:27,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:27,448 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-27 18:11:27,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:27,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369427980] [2019-12-27 18:11:27,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:27,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369427980] [2019-12-27 18:11:27,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:27,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:27,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701000755] [2019-12-27 18:11:27,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:27,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:27,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 329 transitions. [2019-12-27 18:11:27,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:27,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:11:27,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:27,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:27,971 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-27 18:11:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:28,307 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-27 18:11:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:11:28,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:28,318 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:11:28,319 INFO L226 Difference]: Without dead ends: 8394 [2019-12-27 18:11:28,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-27 18:11:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-27 18:11:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-27 18:11:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-27 18:11:28,409 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-27 18:11:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:28,410 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-27 18:11:28,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-27 18:11:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:28,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:28,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:28,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-27 18:11:28,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:28,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094167046] [2019-12-27 18:11:28,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:28,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094167046] [2019-12-27 18:11:28,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:28,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:28,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848595075] [2019-12-27 18:11:28,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:28,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:28,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 363 transitions. [2019-12-27 18:11:28,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:28,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:11:28,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:28,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:28,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:28,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:28,698 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 5 states. [2019-12-27 18:11:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:28,900 INFO L93 Difference]: Finished difference Result 7387 states and 20435 transitions. [2019-12-27 18:11:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:28,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:28,909 INFO L225 Difference]: With dead ends: 7387 [2019-12-27 18:11:28,909 INFO L226 Difference]: Without dead ends: 7387 [2019-12-27 18:11:28,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7387 states. [2019-12-27 18:11:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7387 to 5170. [2019-12-27 18:11:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-27 18:11:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-27 18:11:28,987 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-27 18:11:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:28,987 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-27 18:11:28,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-27 18:11:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:28,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:28,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:28,993 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-27 18:11:28,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:28,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789697633] [2019-12-27 18:11:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:29,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789697633] [2019-12-27 18:11:29,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:29,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:11:29,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716944803] [2019-12-27 18:11:29,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:29,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:29,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 463 transitions. [2019-12-27 18:11:29,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:29,452 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-27 18:11:29,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:11:29,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:11:29,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:11:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:11:29,621 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 13 states. [2019-12-27 18:11:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:31,097 INFO L93 Difference]: Finished difference Result 7557 states and 21020 transitions. [2019-12-27 18:11:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:11:31,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 18:11:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:31,107 INFO L225 Difference]: With dead ends: 7557 [2019-12-27 18:11:31,108 INFO L226 Difference]: Without dead ends: 7557 [2019-12-27 18:11:31,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-27 18:11:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-27 18:11:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 5613. [2019-12-27 18:11:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-27 18:11:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 15757 transitions. [2019-12-27 18:11:31,187 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 15757 transitions. Word has length 67 [2019-12-27 18:11:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:31,188 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 15757 transitions. [2019-12-27 18:11:31,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:11:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 15757 transitions. [2019-12-27 18:11:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:31,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:31,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:31,196 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1617265986, now seen corresponding path program 2 times [2019-12-27 18:11:31,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:31,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392143691] [2019-12-27 18:11:31,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:31,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392143691] [2019-12-27 18:11:31,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:31,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:31,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754350779] [2019-12-27 18:11:31,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:31,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:31,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 402 transitions. [2019-12-27 18:11:31,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:31,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:31,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:31,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:31,493 INFO L87 Difference]: Start difference. First operand 5613 states and 15757 transitions. Second operand 3 states. [2019-12-27 18:11:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:31,558 INFO L93 Difference]: Finished difference Result 5612 states and 15755 transitions. [2019-12-27 18:11:31,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:31,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:11:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:31,566 INFO L225 Difference]: With dead ends: 5612 [2019-12-27 18:11:31,566 INFO L226 Difference]: Without dead ends: 5612 [2019-12-27 18:11:31,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-12-27 18:11:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 2982. [2019-12-27 18:11:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-27 18:11:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 8451 transitions. [2019-12-27 18:11:31,636 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 8451 transitions. Word has length 67 [2019-12-27 18:11:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:31,637 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 8451 transitions. [2019-12-27 18:11:31,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 8451 transitions. [2019-12-27 18:11:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:31,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:31,641 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, 1] [2019-12-27 18:11:31,641 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1277219082, now seen corresponding path program 1 times [2019-12-27 18:11:31,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:31,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576388373] [2019-12-27 18:11:31,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:31,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576388373] [2019-12-27 18:11:31,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:31,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:11:31,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670989017] [2019-12-27 18:11:31,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:31,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:31,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 460 transitions. [2019-12-27 18:11:31,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:31,949 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:11:31,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:11:31,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:11:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:11:31,950 INFO L87 Difference]: Start difference. First operand 2982 states and 8451 transitions. Second operand 6 states. [2019-12-27 18:11:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:32,041 INFO L93 Difference]: Finished difference Result 5208 states and 14722 transitions. [2019-12-27 18:11:32,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:32,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 18:11:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:32,046 INFO L225 Difference]: With dead ends: 5208 [2019-12-27 18:11:32,046 INFO L226 Difference]: Without dead ends: 2810 [2019-12-27 18:11:32,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:11:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-12-27 18:11:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2019-12-27 18:11:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-27 18:11:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-27 18:11:32,083 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 68 [2019-12-27 18:11:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:32,083 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-27 18:11:32,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:11:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-27 18:11:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:32,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:32,087 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, 1] [2019-12-27 18:11:32,087 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 2 times [2019-12-27 18:11:32,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:32,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554442855] [2019-12-27 18:11:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:32,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554442855] [2019-12-27 18:11:32,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:32,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:11:32,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [843422774] [2019-12-27 18:11:32,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:32,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:32,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 18:11:32,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:32,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 18:11:32,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:11:32,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:11:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:11:32,899 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 18 states. [2019-12-27 18:11:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:33,675 INFO L93 Difference]: Finished difference Result 4966 states and 13960 transitions. [2019-12-27 18:11:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:11:33,676 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-27 18:11:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:33,683 INFO L225 Difference]: With dead ends: 4966 [2019-12-27 18:11:33,683 INFO L226 Difference]: Without dead ends: 4941 [2019-12-27 18:11:33,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:11:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2019-12-27 18:11:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3941. [2019-12-27 18:11:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-27 18:11:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-27 18:11:33,744 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-27 18:11:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:33,744 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-27 18:11:33,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:11:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-27 18:11:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:33,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:33,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, 1, 1, 1] [2019-12-27 18:11:33,749 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:33,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 3 times [2019-12-27 18:11:33,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:33,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169946221] [2019-12-27 18:11:33,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:33,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169946221] [2019-12-27 18:11:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:33,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:11:33,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551178153] [2019-12-27 18:11:33,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:33,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:34,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 18:11:34,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:34,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:34,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:11:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:11:34,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:11:34,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:11:34,788 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 18 states. [2019-12-27 18:11:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:35,632 INFO L93 Difference]: Finished difference Result 6127 states and 17103 transitions. [2019-12-27 18:11:35,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:11:35,633 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-27 18:11:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:35,641 INFO L225 Difference]: With dead ends: 6127 [2019-12-27 18:11:35,641 INFO L226 Difference]: Without dead ends: 6102 [2019-12-27 18:11:35,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:11:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-27 18:11:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 4162. [2019-12-27 18:11:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-27 18:11:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-27 18:11:35,706 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-27 18:11:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:35,706 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-27 18:11:35,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:11:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-27 18:11:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:35,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:35,712 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, 1] [2019-12-27 18:11:35,712 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 4 times [2019-12-27 18:11:35,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:35,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068923313] [2019-12-27 18:11:35,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:36,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068923313] [2019-12-27 18:11:36,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:36,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:11:36,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1127495952] [2019-12-27 18:11:36,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:36,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:36,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 18:11:36,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:36,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:36,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 18:11:36,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:11:36,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:11:36,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:11:36,940 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 21 states. [2019-12-27 18:11:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:38,879 INFO L93 Difference]: Finished difference Result 8429 states and 23611 transitions. [2019-12-27 18:11:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:11:38,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-12-27 18:11:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:38,890 INFO L225 Difference]: With dead ends: 8429 [2019-12-27 18:11:38,890 INFO L226 Difference]: Without dead ends: 8404 [2019-12-27 18:11:38,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 19 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=452, Invalid=1804, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:11:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2019-12-27 18:11:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 4378. [2019-12-27 18:11:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2019-12-27 18:11:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 12298 transitions. [2019-12-27 18:11:38,966 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 12298 transitions. Word has length 68 [2019-12-27 18:11:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:38,966 INFO L462 AbstractCegarLoop]: Abstraction has 4378 states and 12298 transitions. [2019-12-27 18:11:38,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:11:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 12298 transitions. [2019-12-27 18:11:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:38,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:38,971 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, 1] [2019-12-27 18:11:38,972 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1379923308, now seen corresponding path program 5 times [2019-12-27 18:11:38,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:38,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836642498] [2019-12-27 18:11:38,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:39,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836642498] [2019-12-27 18:11:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:39,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:11:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178828633] [2019-12-27 18:11:39,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:39,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:39,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 529 transitions. [2019-12-27 18:11:39,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:40,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:11:40,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:40,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:11:40,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:11:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:41,113 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 18:11:41,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 45 times. [2019-12-27 18:11:41,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 18:11:41,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 18:11:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:11:41,147 INFO L87 Difference]: Start difference. First operand 4378 states and 12298 transitions. Second operand 30 states. [2019-12-27 18:11:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:45,886 INFO L93 Difference]: Finished difference Result 10907 states and 30490 transitions. [2019-12-27 18:11:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 18:11:45,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2019-12-27 18:11:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:45,901 INFO L225 Difference]: With dead ends: 10907 [2019-12-27 18:11:45,901 INFO L226 Difference]: Without dead ends: 10882 [2019-12-27 18:11:45,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 21 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=687, Invalid=3473, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 18:11:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10882 states. [2019-12-27 18:11:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10882 to 4624. [2019-12-27 18:11:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2019-12-27 18:11:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 13030 transitions. [2019-12-27 18:11:46,019 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 13030 transitions. Word has length 68 [2019-12-27 18:11:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:46,019 INFO L462 AbstractCegarLoop]: Abstraction has 4624 states and 13030 transitions. [2019-12-27 18:11:46,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 18:11:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 13030 transitions. [2019-12-27 18:11:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:46,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:46,024 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, 1] [2019-12-27 18:11:46,025 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 556311610, now seen corresponding path program 6 times [2019-12-27 18:11:46,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:46,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694341123] [2019-12-27 18:11:46,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:46,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694341123] [2019-12-27 18:11:46,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:46,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:11:46,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1923326890] [2019-12-27 18:11:46,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:46,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:46,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 481 transitions. [2019-12-27 18:11:46,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:46,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 18:11:46,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:11:46,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:46,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:11:46,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:11:46,930 INFO L87 Difference]: Start difference. First operand 4624 states and 13030 transitions. Second operand 20 states. [2019-12-27 18:11:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:48,220 INFO L93 Difference]: Finished difference Result 6404 states and 17812 transitions. [2019-12-27 18:11:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 18:11:48,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 18:11:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:48,229 INFO L225 Difference]: With dead ends: 6404 [2019-12-27 18:11:48,229 INFO L226 Difference]: Without dead ends: 6379 [2019-12-27 18:11:48,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 18:11:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2019-12-27 18:11:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 4062. [2019-12-27 18:11:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-27 18:11:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-27 18:11:48,290 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-27 18:11:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:48,291 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-27 18:11:48,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:11:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-27 18:11:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:48,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:48,294 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, 1] [2019-12-27 18:11:48,295 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 7 times [2019-12-27 18:11:48,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:48,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141154170] [2019-12-27 18:11:48,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:11:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:11:48,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:11:48,416 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:11:48,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_23|)) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1973~0.base_23|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1973~0.base_23| 1)) (= v_~z$read_delayed~0_7 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1973~0.base_23| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1973~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1973~0.base_23|) |v_ULTIMATE.start_main_~#t1973~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t1973~0.offset_17|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_16|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ULTIMATE.start_main_~#t1973~0.offset=|v_ULTIMATE.start_main_~#t1973~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_~#t1973~0.base=|v_ULTIMATE.start_main_~#t1973~0.base_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1974~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1975~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1975~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1973~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1974~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1973~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:11:48,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1974~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1974~0.base_11|) |v_ULTIMATE.start_main_~#t1974~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1974~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1974~0.base_11|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1974~0.base_11| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1974~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1974~0.offset=|v_ULTIMATE.start_main_~#t1974~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1974~0.base=|v_ULTIMATE.start_main_~#t1974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1974~0.base] because there is no mapped edge [2019-12-27 18:11:48,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:11:48,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1975~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1975~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1975~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1975~0.base_12|) |v_ULTIMATE.start_main_~#t1975~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1975~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1975~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1975~0.base=|v_ULTIMATE.start_main_~#t1975~0.base_12|, ULTIMATE.start_main_~#t1975~0.offset=|v_ULTIMATE.start_main_~#t1975~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1975~0.base, ULTIMATE.start_main_~#t1975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:11:48,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-770697725 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-770697725 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-770697725|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-770697725| ~z$w_buff0_used~0_In-770697725) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-770697725, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-770697725} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-770697725|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-770697725, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-770697725} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:11:48,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1784739831 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1784739831 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1784739831 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1784739831 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1784739831 |P0Thread1of1ForFork0_#t~ite6_Out1784739831|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1784739831|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1784739831, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1784739831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784739831, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1784739831} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1784739831|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784739831, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1784739831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784739831, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1784739831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:11:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1443756345 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1443756345 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1443756345 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1443756345 ~z$r_buff0_thd1~0_In1443756345)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1443756345, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1443756345} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1443756345, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1443756345|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1443756345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:11:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1170660975 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1170660975 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1170660975 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1170660975 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1170660975| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1170660975| ~z$r_buff1_thd1~0_In-1170660975)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1170660975, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1170660975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1170660975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1170660975} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1170660975, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1170660975|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1170660975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1170660975, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1170660975} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:11:48,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:11:48,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1526112860 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1526112860 256)))) (or (and (= ~z~0_In-1526112860 |P1Thread1of1ForFork1_#t~ite9_Out-1526112860|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1526112860 |P1Thread1of1ForFork1_#t~ite9_Out-1526112860|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1526112860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526112860, ~z$w_buff1~0=~z$w_buff1~0_In-1526112860, ~z~0=~z~0_In-1526112860} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1526112860|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1526112860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526112860, ~z$w_buff1~0=~z$w_buff1~0_In-1526112860, ~z~0=~z~0_In-1526112860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:11:48,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 18:11:48,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2099008420 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-2099008420 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2099008420| ~z$w_buff0_used~0_In-2099008420) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2099008420| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2099008420, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2099008420} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2099008420, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2099008420|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2099008420} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:11:48,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In454584712 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In454584712 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out454584712| ~z$w_buff1~0_In454584712) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out454584712| ~z~0_In454584712)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In454584712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454584712, ~z$w_buff1~0=~z$w_buff1~0_In454584712, ~z~0=~z~0_In454584712} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out454584712|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In454584712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454584712, ~z$w_buff1~0=~z$w_buff1~0_In454584712, ~z~0=~z~0_In454584712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:11:48,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1213286030 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1213286030 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1213286030 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1213286030 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out1213286030| ~z$w_buff1_used~0_In1213286030) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out1213286030| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1213286030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1213286030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213286030, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1213286030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1213286030, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1213286030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213286030, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1213286030|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1213286030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:11:48,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1188639025 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1188639025 256)))) (or (and (= ~z$r_buff0_thd2~0_In1188639025 |P1Thread1of1ForFork1_#t~ite13_Out1188639025|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1188639025|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1188639025, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1188639025} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1188639025, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1188639025|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1188639025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:11:48,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:11:48,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1476784136 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1476784136 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1476784136| ~z$w_buff0_used~0_In-1476784136)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1476784136| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476784136, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1476784136} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476784136, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1476784136, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1476784136|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:11:48,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In2038157925 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In2038157925 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2038157925 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2038157925 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2038157925 |P2Thread1of1ForFork2_#t~ite18_Out2038157925|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2038157925|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2038157925, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2038157925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2038157925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2038157925} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2038157925, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2038157925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2038157925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2038157925, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2038157925|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:11:48,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In632018479 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In632018479 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out632018479|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out632018479| ~z$r_buff0_thd3~0_In632018479) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632018479, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In632018479} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In632018479, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In632018479, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out632018479|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:11:48,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1586976215 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1586976215 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1586976215 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1586976215 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-1586976215| ~z$r_buff1_thd3~0_In-1586976215) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1586976215| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586976215, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1586976215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1586976215, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1586976215} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586976215, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1586976215|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1586976215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1586976215, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1586976215} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:11:48,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:11:48,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In101255002 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In101255002 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In101255002 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In101255002 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out101255002| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out101255002| ~z$r_buff1_thd2~0_In101255002) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101255002, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In101255002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101255002, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In101255002} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101255002, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In101255002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101255002, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out101255002|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In101255002} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:11:48,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:11:48,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:11:48,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-475787751 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-475787751 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-475787751| ~z$w_buff1~0_In-475787751) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite24_Out-475787751| ~z~0_In-475787751) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-475787751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475787751, ~z$w_buff1~0=~z$w_buff1~0_In-475787751, ~z~0=~z~0_In-475787751} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-475787751, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-475787751|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475787751, ~z$w_buff1~0=~z$w_buff1~0_In-475787751, ~z~0=~z~0_In-475787751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 18:11:48,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 18:11:48,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1155733670 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1155733670 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1155733670| ~z$w_buff0_used~0_In1155733670)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1155733670| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1155733670, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1155733670} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1155733670, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1155733670, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1155733670|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:11:48,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-933554341 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-933554341 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-933554341 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-933554341 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-933554341| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-933554341 |ULTIMATE.start_main_#t~ite27_Out-933554341|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-933554341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-933554341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-933554341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-933554341} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-933554341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-933554341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-933554341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-933554341, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-933554341|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:11:48,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1728997524 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1728997524 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-1728997524| ~z$r_buff0_thd0~0_In-1728997524) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out-1728997524| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1728997524, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728997524} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1728997524, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1728997524|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1728997524} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:11:48,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-438668472 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-438668472 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-438668472 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-438668472 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-438668472|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-438668472 |ULTIMATE.start_main_#t~ite29_Out-438668472|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-438668472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-438668472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-438668472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-438668472} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-438668472, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-438668472|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-438668472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-438668472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-438668472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:11:48,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:11:48,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:11:48,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:11:48,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:11:48 BasicIcfg [2019-12-27 18:11:48,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:11:48,556 INFO L168 Benchmark]: Toolchain (without parser) took 107748.10 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,556 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.53 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 101.1 MB in the beginning and 153.5 MB in the end (delta: -52.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 200.3 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,558 INFO L168 Benchmark]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,558 INFO L168 Benchmark]: RCFGBuilder took 835.34 ms. Allocated memory is still 200.3 MB. Free memory was 148.1 MB in the beginning and 97.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,559 INFO L168 Benchmark]: TraceAbstraction took 106039.14 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 18:11:48,564 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.53 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 101.1 MB in the beginning and 153.5 MB in the end (delta: -52.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 200.3 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.66 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.34 ms. Allocated memory is still 200.3 MB. Free memory was 148.1 MB in the beginning and 97.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106039.14 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2925 SDtfs, 4826 SDslu, 12227 SDs, 0 SdLazy, 9347 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 103 SyntacticMatches, 103 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 92157 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 993 NumberOfCodeBlocks, 993 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 906 ConstructedInterpolants, 0 QuantifiedInterpolants, 290337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...