/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:44:53,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:44:53,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:44:53,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:44:53,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:44:53,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:44:53,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:44:53,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:44:53,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:44:53,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:44:53,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:44:53,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:44:53,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:44:53,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:44:53,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:44:53,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:44:53,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:44:53,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:44:53,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:44:53,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:44:53,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:44:53,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:44:53,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:44:53,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:44:53,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:44:53,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:44:53,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:44:53,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:44:53,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:44:53,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:44:53,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:44:53,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:44:53,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:44:53,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:44:53,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:44:53,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:44:53,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:44:53,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:44:53,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:44:53,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:44:53,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:44:53,504 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.epf [2019-12-27 02:44:53,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:44:53,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:44:53,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:44:53,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:44:53,537 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:44:53,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:44:53,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:44:53,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:44:53,539 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:44:53,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:44:53,539 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:44:53,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:44:53,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:44:53,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:44:53,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:44:53,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:44:53,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:44:53,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:44:53,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:44:53,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:44:53,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:44:53,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:44:53,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:44:53,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:44:53,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:44:53,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:44:53,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:44:53,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:44:53,831 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:44:53,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-27 02:44:53,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16a7fd56/182a22e558d34a0cbc7c626300d1bbf8/FLAGf09363b99 [2019-12-27 02:44:54,451 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:44:54,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-27 02:44:54,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16a7fd56/182a22e558d34a0cbc7c626300d1bbf8/FLAGf09363b99 [2019-12-27 02:44:54,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16a7fd56/182a22e558d34a0cbc7c626300d1bbf8 [2019-12-27 02:44:54,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:44:54,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:44:54,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:54,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:44:54,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:44:54,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:54" (1/1) ... [2019-12-27 02:44:54,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:54, skipping insertion in model container [2019-12-27 02:44:54,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:54" (1/1) ... [2019-12-27 02:44:54,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:44:54,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:44:55,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:55,460 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:44:55,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:55,626 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:44:55,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55 WrapperNode [2019-12-27 02:44:55,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:55,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:55,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:44:55,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:44:55,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:55,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:44:55,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:44:55,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:44:55,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (1/1) ... [2019-12-27 02:44:55,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:44:55,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:44:55,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:44:55,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:44:55,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (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 02:44:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:44:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:44:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:44:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:44:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:44:55,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:44:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:44:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:44:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:44:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:44:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:44:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:44:55,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:44:55,807 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 02:44:56,526 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:44:56,527 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:44:56,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:56 BoogieIcfgContainer [2019-12-27 02:44:56,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:44:56,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:44:56,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:44:56,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:44:56,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:44:54" (1/3) ... [2019-12-27 02:44:56,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdea51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:56, skipping insertion in model container [2019-12-27 02:44:56,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:55" (2/3) ... [2019-12-27 02:44:56,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdea51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:56, skipping insertion in model container [2019-12-27 02:44:56,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:56" (3/3) ... [2019-12-27 02:44:56,538 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.oepc.i [2019-12-27 02:44:56,549 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:44:56,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:44:56,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:44:56,558 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:44:56,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,634 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,662 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:56,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:44:56,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:44:56,718 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:44:56,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:44:56,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:44:56,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:44:56,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:44:56,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:44:56,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:44:56,743 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 02:44:56,745 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:44:56,877 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:44:56,877 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:56,898 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:44:56,921 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:44:57,014 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:44:57,014 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:57,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:44:57,050 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:44:57,051 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:45:02,149 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:45:02,266 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:45:02,646 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 02:45:02,646 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:45:02,650 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 02:45:25,953 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 02:45:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 02:45:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:45:25,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:25,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:45:25,962 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 02:45:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 02:45:25,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:25,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358825663] [2019-12-27 02:45:25,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:26,207 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 02:45:26,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358825663] [2019-12-27 02:45:26,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:26,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:45:26,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607654195] [2019-12-27 02:45:26,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:26,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:26,233 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 02:45:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:29,259 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 02:45:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:45:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:29,970 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 02:45:29,971 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 02:45:29,975 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 02:45:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 02:45:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 02:45:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 02:45:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 02:45:42,228 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 02:45:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:42,228 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 02:45:42,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 02:45:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:45:42,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:42,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:42,233 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 02:45:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 02:45:42,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:42,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863182010] [2019-12-27 02:45:42,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:45:42,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863182010] [2019-12-27 02:45:42,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:42,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:42,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189573249] [2019-12-27 02:45:42,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:45:42,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:45:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:45:42,382 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 02:45:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:47,842 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 02:45:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:45:47,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:45:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:48,597 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 02:45:48,597 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 02:45:48,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:45:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 02:45:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 02:45:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 02:45:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 02:45:58,085 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 02:45:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:58,086 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 02:45:58,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:45:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 02:45:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:45:58,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:58,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:58,092 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 02:45:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 02:45:58,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:58,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788397310] [2019-12-27 02:45:58,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:58,152 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 02:45:58,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788397310] [2019-12-27 02:45:58,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:58,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:58,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658484740] [2019-12-27 02:45:58,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:58,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:58,154 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 02:46:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:03,132 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 02:46:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:03,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:46:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:03,191 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 02:46:03,191 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 02:46:03,192 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 02:46:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 02:46:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 02:46:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 02:46:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 02:46:03,814 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 02:46:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:03,815 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 02:46:03,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 02:46:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:46:03,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:03,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:03,819 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 02:46:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 02:46:03,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:03,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030561693] [2019-12-27 02:46:03,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:03,878 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 02:46:03,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030561693] [2019-12-27 02:46:03,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:03,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:03,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974831028] [2019-12-27 02:46:03,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:03,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:03,881 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 02:46:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:04,067 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 02:46:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:04,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:46:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:04,155 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 02:46:04,155 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 02:46:04,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 02:46:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 02:46:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 02:46:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 02:46:05,258 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 02:46:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:05,259 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 02:46:05,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 02:46:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:46:05,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:05,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:05,263 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 02:46:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 02:46:05,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:05,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544758993] [2019-12-27 02:46:05,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:05,360 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 02:46:05,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544758993] [2019-12-27 02:46:05,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:05,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:05,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189484330] [2019-12-27 02:46:05,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:46:05,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:46:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:05,362 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 02:46:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:05,990 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 02:46:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:46:05,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:46:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:06,077 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 02:46:06,078 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 02:46:06,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 02:46:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 02:46:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 02:46:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 02:46:06,909 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 02:46:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 02:46:06,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:46:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 02:46:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:46:06,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:06,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:06,924 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 02:46:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 02:46:06,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:06,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792156629] [2019-12-27 02:46:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:07,060 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 02:46:07,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792156629] [2019-12-27 02:46:07,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:07,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:07,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505830959] [2019-12-27 02:46:07,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:46:07,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:46:07,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:46:07,063 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-27 02:46:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:08,321 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 02:46:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:08,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:46:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:08,454 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 02:46:08,455 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 02:46:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:46:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 02:46:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 02:46:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 02:46:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 02:46:09,452 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 02:46:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:09,452 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 02:46:09,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:46:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 02:46:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:46:09,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:09,470 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 02:46:09,470 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 02:46:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 02:46:09,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:09,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637937355] [2019-12-27 02:46:09,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:09,542 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 02:46:09,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637937355] [2019-12-27 02:46:09,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:09,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:09,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910066886] [2019-12-27 02:46:09,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:09,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:09,544 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-27 02:46:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:09,623 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 02:46:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:46:09,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:46:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:09,649 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 02:46:09,649 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 02:46:09,649 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 02:46:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 02:46:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 02:46:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 02:46:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 02:46:10,182 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 02:46:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:10,182 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 02:46:10,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 02:46:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:46:10,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:10,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:10,197 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 02:46:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 02:46:10,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:10,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611475499] [2019-12-27 02:46:10,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:10,295 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 02:46:10,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611475499] [2019-12-27 02:46:10,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:10,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:10,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481660197] [2019-12-27 02:46:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:46:10,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:46:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:46:10,297 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 02:46:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:10,985 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 02:46:10,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:46:10,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:46:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:11,034 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 02:46:11,034 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 02:46:11,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:46:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 02:46:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 02:46:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 02:46:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 02:46:11,629 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 02:46:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:11,630 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 02:46:11,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:46:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 02:46:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:46:11,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:11,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:11,663 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 02:46:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 02:46:11,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:11,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239690836] [2019-12-27 02:46:11,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:11,857 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 02:46:11,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239690836] [2019-12-27 02:46:11,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:11,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:46:11,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073574070] [2019-12-27 02:46:11,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:11,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:11,860 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-27 02:46:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:13,165 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 02:46:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:46:13,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:46:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:13,209 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 02:46:13,209 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 02:46:13,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:46:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 02:46:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 02:46:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 02:46:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 02:46:13,566 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 02:46:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:13,567 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 02:46:13,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 02:46:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:46:13,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:13,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:13,592 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 02:46:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 02:46:13,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:13,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905144688] [2019-12-27 02:46:13,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:13,666 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 02:46:13,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905144688] [2019-12-27 02:46:13,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:13,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:46:13,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624865170] [2019-12-27 02:46:13,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:46:13,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:46:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:13,668 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-27 02:46:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:13,766 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 02:46:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:46:13,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:46:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:13,801 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 02:46:13,801 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 02:46:13,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 02:46:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 02:46:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 02:46:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 02:46:14,285 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 02:46:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 02:46:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:46:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 02:46:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:14,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:14,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:14,310 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 02:46:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 02:46:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:14,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038817194] [2019-12-27 02:46:14,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:14,423 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 02:46:14,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038817194] [2019-12-27 02:46:14,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:14,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:14,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226374331] [2019-12-27 02:46:14,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:14,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:14,425 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 02:46:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:14,913 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 02:46:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:14,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:14,969 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 02:46:14,969 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 02:46:14,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 02:46:15,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 02:46:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 02:46:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 02:46:15,467 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 02:46:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:15,467 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 02:46:15,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 02:46:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:15,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:15,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:15,493 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 02:46:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 02:46:15,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:15,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426002530] [2019-12-27 02:46:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:15,579 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 02:46:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426002530] [2019-12-27 02:46:15,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:15,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576510741] [2019-12-27 02:46:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:15,582 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-27 02:46:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:16,232 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-27 02:46:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:46:16,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:16,320 INFO L225 Difference]: With dead ends: 57554 [2019-12-27 02:46:16,320 INFO L226 Difference]: Without dead ends: 41745 [2019-12-27 02:46:16,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-27 02:46:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-27 02:46:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 02:46:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 02:46:17,148 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 02:46:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:17,148 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 02:46:17,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 02:46:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:17,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:17,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:17,182 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 02:46:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 02:46:17,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:17,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742039556] [2019-12-27 02:46:17,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:17,294 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 02:46:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742039556] [2019-12-27 02:46:17,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:17,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:46:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095663537] [2019-12-27 02:46:17,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:46:17,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:46:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:46:17,296 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-27 02:46:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:17,748 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-27 02:46:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:46:17,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:46:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:17,816 INFO L225 Difference]: With dead ends: 51247 [2019-12-27 02:46:17,816 INFO L226 Difference]: Without dead ends: 47407 [2019-12-27 02:46:17,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:46:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-27 02:46:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-27 02:46:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 02:46:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 02:46:18,394 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 02:46:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:18,394 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 02:46:18,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:46:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 02:46:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:46:18,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:18,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:18,435 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 02:46:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 02:46:18,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:18,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187542061] [2019-12-27 02:46:18,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:18,511 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 02:46:18,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187542061] [2019-12-27 02:46:18,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:18,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:18,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159332439] [2019-12-27 02:46:18,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:18,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:18,513 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-27 02:46:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:18,603 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-27 02:46:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:46:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:18,639 INFO L225 Difference]: With dead ends: 20919 [2019-12-27 02:46:18,640 INFO L226 Difference]: Without dead ends: 20919 [2019-12-27 02:46:18,640 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 02:46:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-27 02:46:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-27 02:46:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 02:46:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 02:46:18,943 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 02:46:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:18,944 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 02:46:18,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 02:46:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:46:18,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:18,965 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 02:46:18,965 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 02:46:18,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 02:46:18,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:18,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114059567] [2019-12-27 02:46:18,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:46:19,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114059567] [2019-12-27 02:46:19,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:19,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980991224] [2019-12-27 02:46:19,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:19,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:19,044 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 02:46:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:19,169 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 02:46:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:19,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:46:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:19,204 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 02:46:19,204 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 02:46:19,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 02:46:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 02:46:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 02:46:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 02:46:19,703 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 02:46:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:19,704 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 02:46:19,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 02:46:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:19,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:19,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:19,727 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 02:46:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 02:46:19,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:19,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056393685] [2019-12-27 02:46:19,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:19,788 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 02:46:19,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056393685] [2019-12-27 02:46:19,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:19,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:19,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482732587] [2019-12-27 02:46:19,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:19,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:19,790 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 02:46:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:19,947 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 02:46:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:46:19,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:46:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:19,979 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 02:46:19,979 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 02:46:19,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:46:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 02:46:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 02:46:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 02:46:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 02:46:20,335 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 02:46:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:20,335 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 02:46:20,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 02:46:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:20,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:20,359 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 02:46:20,359 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 02:46:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 02:46:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:20,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107978067] [2019-12-27 02:46:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:20,693 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 02:46:20,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107978067] [2019-12-27 02:46:20,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:20,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:46:20,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590637140] [2019-12-27 02:46:20,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:46:20,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:46:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:46:20,697 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 12 states. [2019-12-27 02:46:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:24,514 INFO L93 Difference]: Finished difference Result 41689 states and 125014 transitions. [2019-12-27 02:46:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 02:46:24,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 02:46:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:24,598 INFO L225 Difference]: With dead ends: 41689 [2019-12-27 02:46:24,598 INFO L226 Difference]: Without dead ends: 41393 [2019-12-27 02:46:24,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=360, Invalid=1710, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 02:46:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41393 states. [2019-12-27 02:46:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41393 to 29462. [2019-12-27 02:46:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29462 states. [2019-12-27 02:46:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29462 states to 29462 states and 90411 transitions. [2019-12-27 02:46:25,383 INFO L78 Accepts]: Start accepts. Automaton has 29462 states and 90411 transitions. Word has length 66 [2019-12-27 02:46:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:25,383 INFO L462 AbstractCegarLoop]: Abstraction has 29462 states and 90411 transitions. [2019-12-27 02:46:25,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:46:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 29462 states and 90411 transitions. [2019-12-27 02:46:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:25,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:25,412 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 02:46:25,413 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 02:46:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1045060168, now seen corresponding path program 2 times [2019-12-27 02:46:25,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7286511] [2019-12-27 02:46:25,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:25,721 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 02:46:25,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7286511] [2019-12-27 02:46:25,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:25,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:46:25,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047324512] [2019-12-27 02:46:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:46:25,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:46:25,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:46:25,724 INFO L87 Difference]: Start difference. First operand 29462 states and 90411 transitions. Second operand 9 states. [2019-12-27 02:46:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:27,216 INFO L93 Difference]: Finished difference Result 41888 states and 126489 transitions. [2019-12-27 02:46:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:46:27,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:46:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:27,274 INFO L225 Difference]: With dead ends: 41888 [2019-12-27 02:46:27,274 INFO L226 Difference]: Without dead ends: 41888 [2019-12-27 02:46:27,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:46:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41888 states. [2019-12-27 02:46:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41888 to 33355. [2019-12-27 02:46:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-12-27 02:46:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 102214 transitions. [2019-12-27 02:46:27,872 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 102214 transitions. Word has length 66 [2019-12-27 02:46:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:27,873 INFO L462 AbstractCegarLoop]: Abstraction has 33355 states and 102214 transitions. [2019-12-27 02:46:27,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:46:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 102214 transitions. [2019-12-27 02:46:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:27,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:27,911 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 02:46:27,911 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 02:46:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1265900300, now seen corresponding path program 3 times [2019-12-27 02:46:27,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:27,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009701272] [2019-12-27 02:46:27,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:28,220 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 02:46:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009701272] [2019-12-27 02:46:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:28,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:46:28,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155479159] [2019-12-27 02:46:28,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:28,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:28,222 INFO L87 Difference]: Start difference. First operand 33355 states and 102214 transitions. Second operand 11 states. [2019-12-27 02:46:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:31,143 INFO L93 Difference]: Finished difference Result 41550 states and 125380 transitions. [2019-12-27 02:46:31,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 02:46:31,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:46:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:31,222 INFO L225 Difference]: With dead ends: 41550 [2019-12-27 02:46:31,223 INFO L226 Difference]: Without dead ends: 41550 [2019-12-27 02:46:31,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 02:46:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41550 states. [2019-12-27 02:46:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41550 to 31009. [2019-12-27 02:46:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31009 states. [2019-12-27 02:46:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31009 states to 31009 states and 95020 transitions. [2019-12-27 02:46:31,775 INFO L78 Accepts]: Start accepts. Automaton has 31009 states and 95020 transitions. Word has length 66 [2019-12-27 02:46:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:31,775 INFO L462 AbstractCegarLoop]: Abstraction has 31009 states and 95020 transitions. [2019-12-27 02:46:31,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 31009 states and 95020 transitions. [2019-12-27 02:46:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:31,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:31,806 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 02:46:31,806 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 02:46:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570610, now seen corresponding path program 4 times [2019-12-27 02:46:31,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:31,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932230472] [2019-12-27 02:46:31,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:32,140 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 02:46:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932230472] [2019-12-27 02:46:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:32,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25421211] [2019-12-27 02:46:32,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:32,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:32,142 INFO L87 Difference]: Start difference. First operand 31009 states and 95020 transitions. Second operand 11 states. [2019-12-27 02:46:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:33,604 INFO L93 Difference]: Finished difference Result 73199 states and 223965 transitions. [2019-12-27 02:46:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 02:46:33,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:46:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:33,709 INFO L225 Difference]: With dead ends: 73199 [2019-12-27 02:46:33,709 INFO L226 Difference]: Without dead ends: 67960 [2019-12-27 02:46:33,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:46:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67960 states. [2019-12-27 02:46:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67960 to 36944. [2019-12-27 02:46:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36944 states. [2019-12-27 02:46:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36944 states to 36944 states and 113286 transitions. [2019-12-27 02:46:34,889 INFO L78 Accepts]: Start accepts. Automaton has 36944 states and 113286 transitions. Word has length 66 [2019-12-27 02:46:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:34,889 INFO L462 AbstractCegarLoop]: Abstraction has 36944 states and 113286 transitions. [2019-12-27 02:46:34,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 36944 states and 113286 transitions. [2019-12-27 02:46:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:34,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:34,929 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 02:46:34,930 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1351919536, now seen corresponding path program 5 times [2019-12-27 02:46:34,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:34,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716511344] [2019-12-27 02:46:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:35,242 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 02:46:35,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716511344] [2019-12-27 02:46:35,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:35,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:35,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907247294] [2019-12-27 02:46:35,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:35,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:35,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:35,244 INFO L87 Difference]: Start difference. First operand 36944 states and 113286 transitions. Second operand 11 states. [2019-12-27 02:46:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:36,529 INFO L93 Difference]: Finished difference Result 68478 states and 208557 transitions. [2019-12-27 02:46:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:46:36,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:46:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:36,606 INFO L225 Difference]: With dead ends: 68478 [2019-12-27 02:46:36,606 INFO L226 Difference]: Without dead ends: 56385 [2019-12-27 02:46:36,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:46:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56385 states. [2019-12-27 02:46:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56385 to 30404. [2019-12-27 02:46:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30404 states. [2019-12-27 02:46:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30404 states to 30404 states and 92540 transitions. [2019-12-27 02:46:37,265 INFO L78 Accepts]: Start accepts. Automaton has 30404 states and 92540 transitions. Word has length 66 [2019-12-27 02:46:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:37,265 INFO L462 AbstractCegarLoop]: Abstraction has 30404 states and 92540 transitions. [2019-12-27 02:46:37,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30404 states and 92540 transitions. [2019-12-27 02:46:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:37,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:37,310 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 02:46:37,310 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 771622506, now seen corresponding path program 6 times [2019-12-27 02:46:37,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:37,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923166869] [2019-12-27 02:46:37,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:37,366 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 02:46:37,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923166869] [2019-12-27 02:46:37,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:37,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:37,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7889882] [2019-12-27 02:46:37,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:37,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:37,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:37,368 INFO L87 Difference]: Start difference. First operand 30404 states and 92540 transitions. Second operand 3 states. [2019-12-27 02:46:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:37,470 INFO L93 Difference]: Finished difference Result 30404 states and 92539 transitions. [2019-12-27 02:46:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:37,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:46:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:37,512 INFO L225 Difference]: With dead ends: 30404 [2019-12-27 02:46:37,512 INFO L226 Difference]: Without dead ends: 30404 [2019-12-27 02:46:37,513 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 02:46:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30404 states. [2019-12-27 02:46:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30404 to 21273. [2019-12-27 02:46:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21273 states. [2019-12-27 02:46:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21273 states to 21273 states and 65617 transitions. [2019-12-27 02:46:37,914 INFO L78 Accepts]: Start accepts. Automaton has 21273 states and 65617 transitions. Word has length 66 [2019-12-27 02:46:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:37,914 INFO L462 AbstractCegarLoop]: Abstraction has 21273 states and 65617 transitions. [2019-12-27 02:46:37,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 21273 states and 65617 transitions. [2019-12-27 02:46:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:37,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:37,937 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 02:46:37,937 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1316797024, now seen corresponding path program 1 times [2019-12-27 02:46:37,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:37,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550230566] [2019-12-27 02:46:37,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:38,416 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 02:46:38,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550230566] [2019-12-27 02:46:38,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:38,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:38,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215710490] [2019-12-27 02:46:38,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:38,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:38,418 INFO L87 Difference]: Start difference. First operand 21273 states and 65617 transitions. Second operand 11 states. [2019-12-27 02:46:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:39,559 INFO L93 Difference]: Finished difference Result 38667 states and 118689 transitions. [2019-12-27 02:46:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:46:39,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:46:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:39,614 INFO L225 Difference]: With dead ends: 38667 [2019-12-27 02:46:39,614 INFO L226 Difference]: Without dead ends: 37614 [2019-12-27 02:46:39,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:46:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37614 states. [2019-12-27 02:46:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37614 to 20605. [2019-12-27 02:46:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20605 states. [2019-12-27 02:46:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 63778 transitions. [2019-12-27 02:46:40,062 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 63778 transitions. Word has length 67 [2019-12-27 02:46:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:40,062 INFO L462 AbstractCegarLoop]: Abstraction has 20605 states and 63778 transitions. [2019-12-27 02:46:40,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 63778 transitions. [2019-12-27 02:46:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:40,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:40,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:40,082 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-27 02:46:40,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:40,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170274602] [2019-12-27 02:46:40,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:46:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:46:40,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:46:40,227 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:46:40,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-27 02:46:40,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-27 02:46:40,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:46:40,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In116415793 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In116415793 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In116415793 |P1Thread1of1ForFork2_#t~ite9_Out116415793|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In116415793 |P1Thread1of1ForFork2_#t~ite9_Out116415793|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In116415793, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116415793, ~z$w_buff1~0=~z$w_buff1~0_In116415793, ~z~0=~z~0_In116415793} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out116415793|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In116415793, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116415793, ~z$w_buff1~0=~z$w_buff1~0_In116415793, ~z~0=~z~0_In116415793} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:46:40,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 02:46:40,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-27 02:46:40,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-478200723 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-478200723 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-478200723|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-478200723| ~z$w_buff0_used~0_In-478200723)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-478200723, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-478200723} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-478200723, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-478200723|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-478200723} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:46:40,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-1094712034 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1094712034 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1094712034 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1094712034 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1094712034| ~z$w_buff1_used~0_In-1094712034) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1094712034|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094712034, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1094712034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094712034, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1094712034} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094712034, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1094712034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094712034, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1094712034|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1094712034} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:46:40,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In330068897 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In330068897 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out330068897|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In330068897 |P1Thread1of1ForFork2_#t~ite13_Out330068897|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In330068897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In330068897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In330068897, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out330068897|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In330068897} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:46:40,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1483648768 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1483648768 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1483648768 256) 0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1483648768 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1483648768 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite26_Out1483648768| ~z$w_buff0_used~0_In1483648768) (= |P2Thread1of1ForFork0_#t~ite26_Out1483648768| |P2Thread1of1ForFork0_#t~ite27_Out1483648768|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1483648768| ~z$w_buff0_used~0_In1483648768) (= |P2Thread1of1ForFork0_#t~ite26_In1483648768| |P2Thread1of1ForFork0_#t~ite26_Out1483648768|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1483648768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1483648768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1483648768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483648768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1483648768, ~weak$$choice2~0=~weak$$choice2~0_In1483648768} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1483648768|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1483648768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1483648768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1483648768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483648768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1483648768, ~weak$$choice2~0=~weak$$choice2~0_In1483648768} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 02:46:40,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:46:40,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-644627869 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-644627869 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-644627869 |P0Thread1of1ForFork1_#t~ite5_Out-644627869|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-644627869|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-644627869, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-644627869} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-644627869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-644627869, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-644627869} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:46:40,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:46:40,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1516903695 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1516903695 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out-1516903695| |P2Thread1of1ForFork0_#t~ite38_Out-1516903695|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-1516903695| ~z$w_buff1~0_In-1516903695)) (and (or .cse0 .cse2) .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-1516903695| ~z~0_In-1516903695)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1516903695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1516903695, ~z$w_buff1~0=~z$w_buff1~0_In-1516903695, ~z~0=~z~0_In-1516903695} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1516903695|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1516903695|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1516903695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1516903695, ~z$w_buff1~0=~z$w_buff1~0_In-1516903695, ~z~0=~z~0_In-1516903695} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:46:40,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-295985538 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-295985538 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-295985538| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-295985538| ~z$w_buff0_used~0_In-295985538)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-295985538, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-295985538} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-295985538, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-295985538|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-295985538} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:46:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1704276544 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1704276544 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1704276544 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1704276544 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1704276544| ~z$w_buff1_used~0_In1704276544) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1704276544| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704276544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1704276544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704276544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704276544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1704276544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1704276544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704276544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704276544, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1704276544|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:46:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1317606237 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1317606237 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1317606237|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1317606237| ~z$r_buff0_thd3~0_In-1317606237)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317606237, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317606237} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317606237, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317606237, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1317606237|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:46:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1388419288 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1388419288 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1388419288 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1388419288 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1388419288 |P2Thread1of1ForFork0_#t~ite43_Out1388419288|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1388419288|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1388419288, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1388419288, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1388419288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1388419288} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1388419288|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1388419288, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1388419288, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1388419288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1388419288} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:46:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:46:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-449946712 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-449946712 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-449946712 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-449946712 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-449946712| ~z$w_buff1_used~0_In-449946712)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-449946712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-449946712, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-449946712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449946712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-449946712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-449946712, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-449946712|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-449946712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-449946712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-449946712} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:46:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1065158720 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1065158720 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1065158720 ~z$r_buff0_thd1~0_Out-1065158720)) (and (= ~z$r_buff0_thd1~0_Out-1065158720 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065158720, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1065158720} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065158720, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1065158720|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1065158720} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:46:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1735676395 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1735676395 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1735676395 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1735676395 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1735676395| ~z$r_buff1_thd1~0_In-1735676395) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1735676395| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735676395, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1735676395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735676395, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1735676395} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1735676395|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735676395, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1735676395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735676395, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1735676395} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:46:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:46:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1701931110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1701931110 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1701931110 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1701931110 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1701931110| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1701931110| ~z$r_buff1_thd2~0_In-1701931110) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701931110, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701931110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701931110, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701931110} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701931110, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701931110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701931110, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1701931110|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701931110} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:46:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:46:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:46:40,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1576556875 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1576556875 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1576556875| |ULTIMATE.start_main_#t~ite47_Out-1576556875|))) (or (and (= ~z$w_buff1~0_In-1576556875 |ULTIMATE.start_main_#t~ite47_Out-1576556875|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~z~0_In-1576556875 |ULTIMATE.start_main_#t~ite47_Out-1576556875|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1576556875, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1576556875, ~z$w_buff1~0=~z$w_buff1~0_In-1576556875, ~z~0=~z~0_In-1576556875} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1576556875, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1576556875|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1576556875, ~z$w_buff1~0=~z$w_buff1~0_In-1576556875, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1576556875|, ~z~0=~z~0_In-1576556875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:46:40,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1750630209 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1750630209 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1750630209| ~z$w_buff0_used~0_In1750630209) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1750630209| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1750630209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1750630209} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1750630209, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1750630209, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1750630209|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:46:40,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-566048064 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-566048064 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-566048064 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-566048064 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-566048064|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-566048064 |ULTIMATE.start_main_#t~ite50_Out-566048064|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-566048064, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-566048064, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-566048064, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-566048064} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-566048064|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-566048064, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-566048064, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-566048064, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-566048064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:46:40,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1090379431 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1090379431 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1090379431| ~z$r_buff0_thd0~0_In-1090379431) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1090379431| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1090379431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1090379431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1090379431, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1090379431|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1090379431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:46:40,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1998592458 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1998592458 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1998592458 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1998592458 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1998592458 |ULTIMATE.start_main_#t~ite52_Out-1998592458|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1998592458|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1998592458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998592458, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1998592458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998592458} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1998592458|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1998592458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998592458, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1998592458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998592458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:46:40,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:46:40,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:46:40 BasicIcfg [2019-12-27 02:46:40,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:46:40,384 INFO L168 Benchmark]: Toolchain (without parser) took 105624.74 ms. Allocated memory was 139.5 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,384 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.16 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 156.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,386 INFO L168 Benchmark]: Boogie Preprocessor took 46.65 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,386 INFO L168 Benchmark]: RCFGBuilder took 786.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,392 INFO L168 Benchmark]: TraceAbstraction took 103850.29 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 02:46:40,396 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 867.16 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 156.7 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.65 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103850.29 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 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.9s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1311, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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 [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6304 SDtfs, 7514 SDslu, 23654 SDs, 0 SdLazy, 11829 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 31 SyntacticMatches, 24 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 250502 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 289427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...