/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/podwr001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:03:16,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:03:16,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:03:16,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:03:16,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:03:16,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:03:16,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:03:16,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:03:16,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:03:16,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:03:16,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:03:16,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:03:16,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:03:16,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:03:16,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:03:16,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:03:16,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:03:16,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:03:16,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:03:16,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:03:16,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:03:16,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:03:16,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:03:16,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:03:16,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:03:16,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:03:16,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:03:16,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:03:16,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:03:16,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:03:16,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:03:16,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:03:16,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:03:16,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:03:16,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:03:16,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:03:16,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:03:16,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:03:16,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:03:16,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:03:16,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:03:16,617 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 03:03:16,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:03:16,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:03:16,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:03:16,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:03:16,644 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:03:16,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:03:16,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:03:16,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:03:16,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:03:16,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:03:16,646 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:03:16,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:03:16,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:03:16,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:03:16,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:03:16,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:03:16,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:03:16,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:03:16,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:03:16,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:03:16,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:03:16,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:03:16,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:03:16,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:03:16,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:03:16,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:03:16,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:03:16,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:03:16,979 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:03:16,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 03:03:17,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c7a3b71/06a3eda03c6d4954b41324b90a2e4fa4/FLAGc869f489f [2019-12-27 03:03:17,602 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:03:17,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.oepc.i [2019-12-27 03:03:17,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c7a3b71/06a3eda03c6d4954b41324b90a2e4fa4/FLAGc869f489f [2019-12-27 03:03:17,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c7a3b71/06a3eda03c6d4954b41324b90a2e4fa4 [2019-12-27 03:03:17,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:03:17,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:03:17,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:03:17,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:03:17,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:03:17,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:03:17" (1/1) ... [2019-12-27 03:03:17,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179c38d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:17, skipping insertion in model container [2019-12-27 03:03:17,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:03:17" (1/1) ... [2019-12-27 03:03:17,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:03:17,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:03:18,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:03:18,503 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:03:18,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:03:18,648 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:03:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18 WrapperNode [2019-12-27 03:03:18,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:03:18,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:03:18,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:03:18,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:03:18,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:03:18,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:03:18,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:03:18,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:03:18,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (1/1) ... [2019-12-27 03:03:18,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:03:18,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:03:18,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:03:18,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:03:18,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (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 03:03:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:03:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:03:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:03:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:03:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:03:18,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:03:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:03:18,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:03:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:03:18,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:03:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:03:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:03:18,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:03:18,824 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 03:03:19,633 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:03:19,634 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:03:19,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:03:19 BoogieIcfgContainer [2019-12-27 03:03:19,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:03:19,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:03:19,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:03:19,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:03:19,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:03:17" (1/3) ... [2019-12-27 03:03:19,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412005a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:03:19, skipping insertion in model container [2019-12-27 03:03:19,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:03:18" (2/3) ... [2019-12-27 03:03:19,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412005a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:03:19, skipping insertion in model container [2019-12-27 03:03:19,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:03:19" (3/3) ... [2019-12-27 03:03:19,643 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.oepc.i [2019-12-27 03:03:19,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:03:19,653 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:03:19,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:03:19,662 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:03:19,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,735 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,752 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,805 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,807 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,820 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:03:19,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:03:19,862 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:03:19,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:03:19,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:03:19,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:03:19,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:03:19,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:03:19,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:03:19,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:03:19,878 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 03:03:19,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 03:03:20,000 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 03:03:20,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:03:20,019 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 03:03:20,040 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 03:03:20,119 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 03:03:20,119 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:03:20,126 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 03:03:20,148 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 03:03:20,149 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:03:25,447 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:03:25,596 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:03:26,015 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 03:03:26,016 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 03:03:26,020 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 03:03:50,102 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 03:03:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 03:03:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:03:50,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:03:50,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:03:50,111 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 03:03:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:03:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 03:03:50,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:03:50,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274793555] [2019-12-27 03:03:50,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:03:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:03:50,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 03:03:50,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274793555] [2019-12-27 03:03:50,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:03:50,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:03:50,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087322170] [2019-12-27 03:03:50,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:03:50,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:03:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:03:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:03:50,394 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 03:03:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:03:52,848 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 03:03:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:03:52,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:03:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:03:53,507 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 03:03:53,507 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 03:03:53,508 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 03:04:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 03:04:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 03:04:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 03:04:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 03:04:03,934 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 03:04:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:03,934 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 03:04:03,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:04:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 03:04:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:04:03,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:03,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:03,940 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 03:04:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 03:04:03,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:03,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838686057] [2019-12-27 03:04:03,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:04,035 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 03:04:04,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838686057] [2019-12-27 03:04:04,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:04,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:04:04,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599398700] [2019-12-27 03:04:04,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:04:04,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:04:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:04:04,038 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 03:04:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:09,280 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 03:04:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:04:09,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:04:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:10,551 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 03:04:10,551 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 03:04:10,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:04:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 03:04:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 03:04:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 03:04:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 03:04:21,025 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 03:04:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:21,025 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 03:04:21,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:04:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 03:04:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:04:21,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:21,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:21,034 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 03:04:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 03:04:21,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:21,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621862589] [2019-12-27 03:04:21,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:21,104 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 03:04:21,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621862589] [2019-12-27 03:04:21,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:21,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:04:21,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425894070] [2019-12-27 03:04:21,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:04:21,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:04:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:04:21,106 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 03:04:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:26,059 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 03:04:26,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:04:26,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:04:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:26,126 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 03:04:26,127 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 03:04:26,127 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 03:04:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 03:04:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 03:04:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 03:04:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 03:04:26,873 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 03:04:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:26,873 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 03:04:26,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:04:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 03:04:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:04:26,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:26,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:26,877 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 03:04:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 03:04:26,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:26,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391930271] [2019-12-27 03:04:26,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:26,936 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 03:04:26,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391930271] [2019-12-27 03:04:26,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:26,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:04:26,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454031198] [2019-12-27 03:04:26,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:04:26,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:04:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:04:26,942 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 03:04:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:27,151 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 03:04:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:04:27,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:04:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:27,250 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 03:04:27,250 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 03:04:27,250 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 03:04:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 03:04:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 03:04:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 03:04:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 03:04:28,342 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 03:04:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:28,343 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 03:04:28,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:04:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 03:04:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:04:28,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:28,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:28,348 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 03:04:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 03:04:28,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174028379] [2019-12-27 03:04:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:28,428 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 03:04:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174028379] [2019-12-27 03:04:28,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:28,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:04:28,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992139615] [2019-12-27 03:04:28,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:04:28,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:28,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:04:28,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:04:28,430 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 03:04:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:29,060 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 03:04:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:04:29,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 03:04:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:29,155 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 03:04:29,155 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 03:04:29,155 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 03:04:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 03:04:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 03:04:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 03:04:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 03:04:30,320 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 03:04:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:30,321 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 03:04:30,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:04:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 03:04:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:04:30,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:30,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:30,335 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 03:04:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 03:04:30,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:30,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528250797] [2019-12-27 03:04:30,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:30,428 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 03:04:30,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528250797] [2019-12-27 03:04:30,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:30,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:04:30,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84073961] [2019-12-27 03:04:30,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:04:30,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:04:30,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:04:30,430 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-27 03:04:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:31,485 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 03:04:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:04:31,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:04:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:31,614 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 03:04:31,615 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 03:04:31,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:04:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 03:04:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 03:04:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 03:04:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 03:04:32,881 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 03:04:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:32,881 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 03:04:32,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:04:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 03:04:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:04:32,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:32,899 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 03:04:32,899 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 03:04:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 03:04:32,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:32,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660389596] [2019-12-27 03:04:32,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:32,945 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 03:04:32,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660389596] [2019-12-27 03:04:32,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:32,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:04:32,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050309576] [2019-12-27 03:04:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:04:32,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:04:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:04:32,948 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-27 03:04:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:33,049 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 03:04:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:04:33,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:04:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:33,092 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 03:04:33,092 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 03:04:33,093 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 03:04:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 03:04:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 03:04:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 03:04:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 03:04:33,661 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 03:04:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:33,661 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 03:04:33,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:04:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 03:04:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:04:33,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:33,675 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 03:04:33,675 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 03:04:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 03:04:33,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:33,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570737451] [2019-12-27 03:04:33,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:33,767 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 03:04:33,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570737451] [2019-12-27 03:04:33,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:33,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:04:33,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594716613] [2019-12-27 03:04:33,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:04:33,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:04:33,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:04:33,770 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 03:04:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:34,373 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 03:04:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:04:34,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 03:04:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:34,409 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 03:04:34,409 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 03:04:34,409 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 03:04:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 03:04:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 03:04:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 03:04:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 03:04:34,768 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 03:04:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:34,768 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 03:04:34,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:04:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 03:04:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:04:34,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:34,791 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 03:04:34,791 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 03:04:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 03:04:34,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:34,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061506240] [2019-12-27 03:04:34,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:34,908 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 03:04:34,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061506240] [2019-12-27 03:04:34,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:34,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:04:34,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255372231] [2019-12-27 03:04:34,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:04:34,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:04:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:04:34,911 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-27 03:04:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:36,208 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 03:04:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:04:36,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 03:04:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:36,248 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 03:04:36,249 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 03:04:36,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:04:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 03:04:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 03:04:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 03:04:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 03:04:36,614 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 03:04:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:36,615 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 03:04:36,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:04:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 03:04:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:04:36,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:36,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:36,642 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 03:04:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 03:04:36,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:36,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727042598] [2019-12-27 03:04:36,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:36,884 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 03:04:36,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727042598] [2019-12-27 03:04:36,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:36,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:04:36,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867196805] [2019-12-27 03:04:36,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:04:36,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:04:36,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:04:36,886 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-27 03:04:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:36,975 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 03:04:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:04:36,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 03:04:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:37,009 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 03:04:37,010 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 03:04:37,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:04:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 03:04:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 03:04:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 03:04:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 03:04:37,364 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 03:04:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:37,365 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 03:04:37,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:04:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 03:04:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:04:37,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:37,390 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 03:04:37,390 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 03:04:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 03:04:37,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:37,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952821392] [2019-12-27 03:04:37,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:37,503 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 03:04:37,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952821392] [2019-12-27 03:04:37,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:37,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:04:37,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601428931] [2019-12-27 03:04:37,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:04:37,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:04:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:04:37,507 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 03:04:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:38,013 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 03:04:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:04:38,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:04:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:38,069 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 03:04:38,069 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 03:04:38,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:04:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 03:04:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 03:04:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 03:04:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 03:04:38,556 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 03:04:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:38,556 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 03:04:38,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:04:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 03:04:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:04:38,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:38,582 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 03:04:38,582 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 03:04:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 03:04:38,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:38,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188921341] [2019-12-27 03:04:38,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:38,690 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 03:04:38,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188921341] [2019-12-27 03:04:38,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:38,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:04:38,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746301748] [2019-12-27 03:04:38,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:04:38,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:04:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:04:38,693 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-27 03:04:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:39,567 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-27 03:04:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:04:39,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:04:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:39,659 INFO L225 Difference]: With dead ends: 57554 [2019-12-27 03:04:39,660 INFO L226 Difference]: Without dead ends: 41745 [2019-12-27 03:04:39,660 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 03:04:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-27 03:04:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-27 03:04:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 03:04:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 03:04:40,257 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 03:04:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:40,257 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 03:04:40,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:04:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 03:04:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:04:40,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:40,291 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 03:04:40,291 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 03:04:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 03:04:40,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:40,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167758131] [2019-12-27 03:04:40,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:40,379 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 03:04:40,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167758131] [2019-12-27 03:04:40,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:40,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:04:40,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811975948] [2019-12-27 03:04:40,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:04:40,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:04:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:04:40,383 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-27 03:04:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:40,950 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-27 03:04:40,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:04:40,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:04:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:41,051 INFO L225 Difference]: With dead ends: 51247 [2019-12-27 03:04:41,051 INFO L226 Difference]: Without dead ends: 47407 [2019-12-27 03:04:41,052 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 03:04:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-27 03:04:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-27 03:04:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 03:04:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 03:04:41,679 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 03:04:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:41,679 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 03:04:41,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:04:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 03:04:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:04:41,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:41,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:41,722 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 03:04:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 03:04:41,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:41,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529855550] [2019-12-27 03:04:41,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:42,047 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 03:04:42,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529855550] [2019-12-27 03:04:42,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:42,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:04:42,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849308726] [2019-12-27 03:04:42,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:04:42,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:42,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:04:42,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:04:42,049 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-27 03:04:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:42,141 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-27 03:04:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:04:42,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:04:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:42,169 INFO L225 Difference]: With dead ends: 20919 [2019-12-27 03:04:42,170 INFO L226 Difference]: Without dead ends: 20919 [2019-12-27 03:04:42,170 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 03:04:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-27 03:04:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-27 03:04:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 03:04:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 03:04:42,477 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 03:04:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:42,477 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 03:04:42,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:04:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 03:04:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:04:42,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:42,499 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 03:04:42,499 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 03:04:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 03:04:42,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:42,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957839930] [2019-12-27 03:04:42,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:42,561 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 03:04:42,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957839930] [2019-12-27 03:04:42,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:42,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:04:42,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177054999] [2019-12-27 03:04:42,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:04:42,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:04:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:04:42,563 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 03:04:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:42,716 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 03:04:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:04:42,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:04:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:42,761 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 03:04:42,761 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 03:04:42,763 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 03:04:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 03:04:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 03:04:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 03:04:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 03:04:43,124 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 03:04:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:43,125 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 03:04:43,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:04:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 03:04:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:43,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:43,149 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 03:04:43,149 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 03:04:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 03:04:43,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:43,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568037766] [2019-12-27 03:04:43,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:43,221 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 03:04:43,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568037766] [2019-12-27 03:04:43,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:43,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:04:43,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130705472] [2019-12-27 03:04:43,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:04:43,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:43,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:04:43,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:04:43,226 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 03:04:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:43,403 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 03:04:43,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:04:43,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 03:04:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:43,449 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 03:04:43,449 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 03:04:43,449 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 03:04:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 03:04:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 03:04:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 03:04:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 03:04:44,060 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 03:04:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 03:04:44,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:04:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 03:04:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:44,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:44,096 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 03:04:44,096 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 03:04:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 03:04:44,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:44,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638668793] [2019-12-27 03:04:44,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:44,304 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 03:04:44,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638668793] [2019-12-27 03:04:44,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:44,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:04:44,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301293807] [2019-12-27 03:04:44,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:04:44,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:04:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:04:44,306 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-27 03:04:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:46,640 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 03:04:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:04:46,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 03:04:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:46,719 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 03:04:46,719 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 03:04:46,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:04:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 03:04:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 03:04:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 03:04:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 03:04:47,536 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 03:04:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:47,536 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 03:04:47,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:04:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 03:04:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:47,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:47,579 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 03:04:47,579 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 03:04:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 03:04:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:47,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750518182] [2019-12-27 03:04:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:47,866 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 03:04:47,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750518182] [2019-12-27 03:04:47,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:47,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:04:47,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139438395] [2019-12-27 03:04:47,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:04:47,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:04:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:04:47,873 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-27 03:04:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:49,634 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-27 03:04:49,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:04:49,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 03:04:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:49,679 INFO L225 Difference]: With dead ends: 37884 [2019-12-27 03:04:49,679 INFO L226 Difference]: Without dead ends: 31924 [2019-12-27 03:04:49,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:04:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-27 03:04:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-27 03:04:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 03:04:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 03:04:50,269 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 03:04:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:50,270 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 03:04:50,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:04:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 03:04:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:50,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:50,300 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 03:04:50,300 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 03:04:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 03:04:50,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:50,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525464407] [2019-12-27 03:04:50,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:50,464 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 03:04:50,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525464407] [2019-12-27 03:04:50,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:50,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:04:50,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710872248] [2019-12-27 03:04:50,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:04:50,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:04:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:04:50,467 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-27 03:04:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:52,349 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 03:04:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 03:04:52,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:04:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:52,395 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 03:04:52,395 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 03:04:52,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:04:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 03:04:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 03:04:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 03:04:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 03:04:52,810 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 03:04:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:52,810 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 03:04:52,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:04:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 03:04:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:52,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:52,834 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 03:04:52,834 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 03:04:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 03:04:52,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:52,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557789799] [2019-12-27 03:04:52,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:52,988 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 03:04:52,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557789799] [2019-12-27 03:04:52,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:52,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:04:52,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684657403] [2019-12-27 03:04:52,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:04:52,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:52,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:04:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:04:52,990 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 11 states. [2019-12-27 03:04:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:54,890 INFO L93 Difference]: Finished difference Result 35662 states and 109099 transitions. [2019-12-27 03:04:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:04:54,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:04:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:54,934 INFO L225 Difference]: With dead ends: 35662 [2019-12-27 03:04:54,934 INFO L226 Difference]: Without dead ends: 31290 [2019-12-27 03:04:54,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:04:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31290 states. [2019-12-27 03:04:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31290 to 21989. [2019-12-27 03:04:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-27 03:04:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-27 03:04:55,490 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-27 03:04:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:55,490 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-27 03:04:55,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:04:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-27 03:04:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:55,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:55,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:04:55,517 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 03:04:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-27 03:04:55,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:55,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059430350] [2019-12-27 03:04:55,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:55,712 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 03:04:55,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059430350] [2019-12-27 03:04:55,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:55,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:04:55,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963906562] [2019-12-27 03:04:55,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:04:55,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:04:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:04:55,714 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 12 states. [2019-12-27 03:04:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:04:57,928 INFO L93 Difference]: Finished difference Result 33586 states and 102667 transitions. [2019-12-27 03:04:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:04:57,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 03:04:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:04:57,977 INFO L225 Difference]: With dead ends: 33586 [2019-12-27 03:04:57,978 INFO L226 Difference]: Without dead ends: 31848 [2019-12-27 03:04:57,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:04:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31848 states. [2019-12-27 03:04:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31848 to 21855. [2019-12-27 03:04:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-27 03:04:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-27 03:04:58,396 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-27 03:04:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:04:58,397 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-27 03:04:58,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:04:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-27 03:04:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:04:58,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:04:58,429 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 03:04:58,430 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 03:04:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:04:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-27 03:04:58,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:04:58,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488349414] [2019-12-27 03:04:58,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:04:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:04:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:04:58,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488349414] [2019-12-27 03:04:58,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:04:58,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:04:58,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404502908] [2019-12-27 03:04:58,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:04:58,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:04:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:04:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:04:58,662 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 12 states. [2019-12-27 03:05:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:01,863 INFO L93 Difference]: Finished difference Result 40439 states and 122976 transitions. [2019-12-27 03:05:01,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 03:05:01,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 03:05:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:01,916 INFO L225 Difference]: With dead ends: 40439 [2019-12-27 03:05:01,916 INFO L226 Difference]: Without dead ends: 34717 [2019-12-27 03:05:01,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 03:05:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34717 states. [2019-12-27 03:05:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34717 to 21642. [2019-12-27 03:05:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21642 states. [2019-12-27 03:05:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21642 states to 21642 states and 66434 transitions. [2019-12-27 03:05:02,399 INFO L78 Accepts]: Start accepts. Automaton has 21642 states and 66434 transitions. Word has length 66 [2019-12-27 03:05:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:02,399 INFO L462 AbstractCegarLoop]: Abstraction has 21642 states and 66434 transitions. [2019-12-27 03:05:02,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:05:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 21642 states and 66434 transitions. [2019-12-27 03:05:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:05:02,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:02,420 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 03:05:02,420 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 03:05:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 99317356, now seen corresponding path program 7 times [2019-12-27 03:05:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:02,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207602843] [2019-12-27 03:05:02,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:05:02,631 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 03:05:02,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207602843] [2019-12-27 03:05:02,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:05:02,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:05:02,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270473920] [2019-12-27 03:05:02,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:05:02,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:05:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:05:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:05:02,633 INFO L87 Difference]: Start difference. First operand 21642 states and 66434 transitions. Second operand 11 states. [2019-12-27 03:05:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:05,597 INFO L93 Difference]: Finished difference Result 38167 states and 113736 transitions. [2019-12-27 03:05:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 03:05:05,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:05:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:05,649 INFO L225 Difference]: With dead ends: 38167 [2019-12-27 03:05:05,650 INFO L226 Difference]: Without dead ends: 37739 [2019-12-27 03:05:05,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 03:05:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37739 states. [2019-12-27 03:05:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37739 to 26181. [2019-12-27 03:05:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26181 states. [2019-12-27 03:05:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26181 states to 26181 states and 79865 transitions. [2019-12-27 03:05:06,326 INFO L78 Accepts]: Start accepts. Automaton has 26181 states and 79865 transitions. Word has length 66 [2019-12-27 03:05:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:06,327 INFO L462 AbstractCegarLoop]: Abstraction has 26181 states and 79865 transitions. [2019-12-27 03:05:06,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:05:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26181 states and 79865 transitions. [2019-12-27 03:05:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:05:06,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:06,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 03:05:06,359 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 03:05:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 8 times [2019-12-27 03:05:06,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:06,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138920798] [2019-12-27 03:05:06,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:05:06,797 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 03:05:06,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138920798] [2019-12-27 03:05:06,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:05:06,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:05:06,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444894793] [2019-12-27 03:05:06,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:05:06,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:05:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:05:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:05:06,799 INFO L87 Difference]: Start difference. First operand 26181 states and 79865 transitions. Second operand 16 states. [2019-12-27 03:05:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:11,403 INFO L93 Difference]: Finished difference Result 60702 states and 181538 transitions. [2019-12-27 03:05:11,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 03:05:11,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 03:05:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:11,491 INFO L225 Difference]: With dead ends: 60702 [2019-12-27 03:05:11,491 INFO L226 Difference]: Without dead ends: 60534 [2019-12-27 03:05:11,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=2007, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 03:05:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60534 states. [2019-12-27 03:05:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60534 to 35818. [2019-12-27 03:05:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35818 states. [2019-12-27 03:05:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35818 states to 35818 states and 109052 transitions. [2019-12-27 03:05:12,541 INFO L78 Accepts]: Start accepts. Automaton has 35818 states and 109052 transitions. Word has length 66 [2019-12-27 03:05:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:12,541 INFO L462 AbstractCegarLoop]: Abstraction has 35818 states and 109052 transitions. [2019-12-27 03:05:12,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:05:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 35818 states and 109052 transitions. [2019-12-27 03:05:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:05:12,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:12,579 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 03:05:12,579 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:05:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 983480798, now seen corresponding path program 9 times [2019-12-27 03:05:12,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:12,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530568950] [2019-12-27 03:05:12,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:05:12,643 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 03:05:12,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530568950] [2019-12-27 03:05:12,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:05:12,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:05:12,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855218049] [2019-12-27 03:05:12,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:05:12,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:05:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:05:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:05:12,645 INFO L87 Difference]: Start difference. First operand 35818 states and 109052 transitions. Second operand 3 states. [2019-12-27 03:05:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:12,787 INFO L93 Difference]: Finished difference Result 35818 states and 109051 transitions. [2019-12-27 03:05:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:05:12,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:05:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:12,838 INFO L225 Difference]: With dead ends: 35818 [2019-12-27 03:05:12,838 INFO L226 Difference]: Without dead ends: 35818 [2019-12-27 03:05:12,838 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 03:05:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2019-12-27 03:05:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 28967. [2019-12-27 03:05:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28967 states. [2019-12-27 03:05:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28967 states to 28967 states and 89470 transitions. [2019-12-27 03:05:13,367 INFO L78 Accepts]: Start accepts. Automaton has 28967 states and 89470 transitions. Word has length 66 [2019-12-27 03:05:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:13,367 INFO L462 AbstractCegarLoop]: Abstraction has 28967 states and 89470 transitions. [2019-12-27 03:05:13,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:05:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28967 states and 89470 transitions. [2019-12-27 03:05:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:05:13,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:13,400 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 03:05:13,400 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:05:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 1 times [2019-12-27 03:05:13,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882376209] [2019-12-27 03:05:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:05:13,814 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 03:05:13,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882376209] [2019-12-27 03:05:13,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:05:13,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:05:13,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821005261] [2019-12-27 03:05:13,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:05:13,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:05:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:05:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:05:13,816 INFO L87 Difference]: Start difference. First operand 28967 states and 89470 transitions. Second operand 17 states. [2019-12-27 03:05:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:18,948 INFO L93 Difference]: Finished difference Result 46424 states and 139956 transitions. [2019-12-27 03:05:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 03:05:18,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 03:05:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:19,009 INFO L225 Difference]: With dead ends: 46424 [2019-12-27 03:05:19,009 INFO L226 Difference]: Without dead ends: 45657 [2019-12-27 03:05:19,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 03:05:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45657 states. [2019-12-27 03:05:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45657 to 28963. [2019-12-27 03:05:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28963 states. [2019-12-27 03:05:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28963 states to 28963 states and 89459 transitions. [2019-12-27 03:05:19,573 INFO L78 Accepts]: Start accepts. Automaton has 28963 states and 89459 transitions. Word has length 67 [2019-12-27 03:05:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:19,573 INFO L462 AbstractCegarLoop]: Abstraction has 28963 states and 89459 transitions. [2019-12-27 03:05:19,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:05:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28963 states and 89459 transitions. [2019-12-27 03:05:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:05:19,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:19,605 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 03:05:19,605 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:05:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1325995694, now seen corresponding path program 2 times [2019-12-27 03:05:19,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:19,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887775879] [2019-12-27 03:05:19,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:05:20,025 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 03:05:20,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887775879] [2019-12-27 03:05:20,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:05:20,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:05:20,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971333258] [2019-12-27 03:05:20,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:05:20,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:05:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:05:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:05:20,027 INFO L87 Difference]: Start difference. First operand 28963 states and 89459 transitions. Second operand 13 states. [2019-12-27 03:05:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:05:21,309 INFO L93 Difference]: Finished difference Result 32620 states and 99390 transitions. [2019-12-27 03:05:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:05:21,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 03:05:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:05:21,355 INFO L225 Difference]: With dead ends: 32620 [2019-12-27 03:05:21,355 INFO L226 Difference]: Without dead ends: 31697 [2019-12-27 03:05:21,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:05:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31697 states. [2019-12-27 03:05:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31697 to 28871. [2019-12-27 03:05:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28871 states. [2019-12-27 03:05:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28871 states to 28871 states and 89210 transitions. [2019-12-27 03:05:21,818 INFO L78 Accepts]: Start accepts. Automaton has 28871 states and 89210 transitions. Word has length 67 [2019-12-27 03:05:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:05:21,819 INFO L462 AbstractCegarLoop]: Abstraction has 28871 states and 89210 transitions. [2019-12-27 03:05:21,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:05:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28871 states and 89210 transitions. [2019-12-27 03:05:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:05:21,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:05:21,851 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 03:05:21,851 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:05:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:05:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 3 times [2019-12-27 03:05:21,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:05:21,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397014669] [2019-12-27 03:05:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:05:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:05:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:05:22,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:05:22,006 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:05:22,010 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) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1567~0.base_23|) |v_ULTIMATE.start_main_~#t1567~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1567~0.base_23|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_23| 1) |v_#valid_60|) (= 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) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1567~0.base_23| 4) |v_#length_21|) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (select .cse0 |v_ULTIMATE.start_main_~#t1567~0.base_23|) 0) (= |v_ULTIMATE.start_main_~#t1567~0.offset_17| 0) (= 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{ULTIMATE.start_main_~#t1567~0.offset=|v_ULTIMATE.start_main_~#t1567~0.offset_17|, ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_19|, ~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_#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, ~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, ULTIMATE.start_main_~#t1567~0.base=|v_ULTIMATE.start_main_~#t1567~0.base_23|, ~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_#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_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_17|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_14|, ~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} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1567~0.offset, ULTIMATE.start_main_~#t1568~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1567~0.base, ~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_#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_~#t1568~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:05:22,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1568~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1568~0.base_11|) |v_ULTIMATE.start_main_~#t1568~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1568~0.offset_9| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1568~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1568~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1568~0.base=|v_ULTIMATE.start_main_~#t1568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, 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_~#t1568~0.offset=|v_ULTIMATE.start_main_~#t1568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1568~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1568~0.offset] because there is no mapped edge [2019-12-27 03:05:22,012 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 03:05:22,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1270841977 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1270841977 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1270841977 |P1Thread1of1ForFork2_#t~ite9_Out-1270841977|)) (and (= ~z$w_buff1~0_In-1270841977 |P1Thread1of1ForFork2_#t~ite9_Out-1270841977|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1270841977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1270841977, ~z$w_buff1~0=~z$w_buff1~0_In-1270841977, ~z~0=~z~0_In-1270841977} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1270841977|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1270841977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1270841977, ~z$w_buff1~0=~z$w_buff1~0_In-1270841977, ~z~0=~z~0_In-1270841977} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 03:05:22,014 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 03:05:22,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1569~0.base_13|) |v_ULTIMATE.start_main_~#t1569~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1569~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1569~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1569~0.base_13| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1569~0.offset_11| 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1569~0.base_13| 1) |v_#valid_36|)) 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|, ULTIMATE.start_main_~#t1569~0.base=|v_ULTIMATE.start_main_~#t1569~0.base_13|, ULTIMATE.start_main_~#t1569~0.offset=|v_ULTIMATE.start_main_~#t1569~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1569~0.base, ULTIMATE.start_main_~#t1569~0.offset, #length] because there is no mapped edge [2019-12-27 03:05:22,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In308082645 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In308082645 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out308082645| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out308082645| ~z$w_buff0_used~0_In308082645)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In308082645, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In308082645} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In308082645, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out308082645|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In308082645} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:05:22,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1586353990 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1586353990 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1586353990 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1586353990 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1586353990| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1586353990 |P1Thread1of1ForFork2_#t~ite12_Out1586353990|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1586353990, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1586353990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586353990, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1586353990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1586353990, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1586353990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1586353990, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1586353990|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1586353990} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 03:05:22,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In673202687 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In673202687 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out673202687|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In673202687 |P1Thread1of1ForFork2_#t~ite13_Out673202687|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In673202687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out673202687|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In673202687} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 03:05:22,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In479408002 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In479408002| |P2Thread1of1ForFork0_#t~ite26_Out479408002|) (= ~z$w_buff0_used~0_In479408002 |P2Thread1of1ForFork0_#t~ite27_Out479408002|)) (and (= ~z$w_buff0_used~0_In479408002 |P2Thread1of1ForFork0_#t~ite26_Out479408002|) (= |P2Thread1of1ForFork0_#t~ite27_Out479408002| |P2Thread1of1ForFork0_#t~ite26_Out479408002|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In479408002 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In479408002 256)) .cse1) (= (mod ~z$w_buff0_used~0_In479408002 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In479408002 256) 0))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In479408002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In479408002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In479408002, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002, ~weak$$choice2~0=~weak$$choice2~0_In479408002} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out479408002|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out479408002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In479408002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In479408002, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002, ~weak$$choice2~0=~weak$$choice2~0_In479408002} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 03:05:22,022 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 03:05:22,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1385491016 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1385491016 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1385491016|)) (and (= ~z$w_buff0_used~0_In1385491016 |P0Thread1of1ForFork1_#t~ite5_Out1385491016|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1385491016, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1385491016} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1385491016|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1385491016, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1385491016} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 03:05:22,024 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 03:05:22,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2005960575 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out2005960575| |P2Thread1of1ForFork0_#t~ite38_Out2005960575|)) (.cse0 (= (mod ~z$w_buff1_used~0_In2005960575 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In2005960575 |P2Thread1of1ForFork0_#t~ite38_Out2005960575|)) (and (not .cse1) (= ~z$w_buff1~0_In2005960575 |P2Thread1of1ForFork0_#t~ite38_Out2005960575|) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2005960575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2005960575, ~z$w_buff1~0=~z$w_buff1~0_In2005960575, ~z~0=~z~0_In2005960575} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2005960575|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2005960575|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2005960575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2005960575, ~z$w_buff1~0=~z$w_buff1~0_In2005960575, ~z~0=~z~0_In2005960575} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 03:05:22,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1254301718 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1254301718 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1254301718|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1254301718 |P2Thread1of1ForFork0_#t~ite40_Out1254301718|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1254301718} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1254301718|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1254301718} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 03:05:22,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-543389275 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-543389275 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-543389275 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-543389275 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-543389275 |P2Thread1of1ForFork0_#t~ite41_Out-543389275|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-543389275|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-543389275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-543389275} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-543389275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-543389275, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-543389275|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 03:05:22,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2146885020 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2146885020 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-2146885020| ~z$r_buff0_thd3~0_In-2146885020) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-2146885020|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146885020, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2146885020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146885020, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2146885020, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2146885020|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 03:05:22,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-792801952 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-792801952 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-792801952 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-792801952 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-792801952| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-792801952 |P2Thread1of1ForFork0_#t~ite43_Out-792801952|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-792801952, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792801952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792801952, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-792801952} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-792801952|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-792801952, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792801952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792801952, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-792801952} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 03:05:22,028 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 03:05:22,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1892564737 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1892564737 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1892564737 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1892564737 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1892564737|)) (and (= ~z$w_buff1_used~0_In-1892564737 |P0Thread1of1ForFork1_#t~ite6_Out-1892564737|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892564737, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892564737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892564737, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892564737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892564737, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1892564737|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892564737, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892564737, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892564737} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 03:05:22,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2143208695 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2143208695 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-2143208695 ~z$r_buff0_thd1~0_Out-2143208695)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-2143208695)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143208695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2143208695} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2143208695, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2143208695|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2143208695} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:05:22,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In265794656 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In265794656 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In265794656 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In265794656 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out265794656| ~z$r_buff1_thd1~0_In265794656)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out265794656|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In265794656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265794656, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In265794656} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out265794656|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In265794656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In265794656, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In265794656} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 03:05:22,029 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 03:05:22,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In581920873 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In581920873 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In581920873 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In581920873 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out581920873|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In581920873 |P1Thread1of1ForFork2_#t~ite14_Out581920873|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In581920873, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In581920873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In581920873, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In581920873} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In581920873, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In581920873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In581920873, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out581920873|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In581920873} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:05:22,030 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 03:05:22,030 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 03:05:22,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In437952708 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In437952708 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out437952708| |ULTIMATE.start_main_#t~ite47_Out437952708|))) (or (and (= ~z$w_buff1~0_In437952708 |ULTIMATE.start_main_#t~ite47_Out437952708|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= ~z~0_In437952708 |ULTIMATE.start_main_#t~ite47_Out437952708|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In437952708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In437952708, ~z$w_buff1~0=~z$w_buff1~0_In437952708, ~z~0=~z~0_In437952708} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In437952708, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out437952708|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In437952708, ~z$w_buff1~0=~z$w_buff1~0_In437952708, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out437952708|, ~z~0=~z~0_In437952708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:05:22,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In946888932 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In946888932 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In946888932 |ULTIMATE.start_main_#t~ite49_Out946888932|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out946888932|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946888932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946888932} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946888932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946888932, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out946888932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 03:05:22,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1410808844 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1410808844 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1410808844 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1410808844 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1410808844| 0)) (and (= ~z$w_buff1_used~0_In-1410808844 |ULTIMATE.start_main_#t~ite50_Out-1410808844|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1410808844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1410808844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1410808844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1410808844} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1410808844|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1410808844, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1410808844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1410808844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1410808844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 03:05:22,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-282746812 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-282746812 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-282746812| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-282746812 |ULTIMATE.start_main_#t~ite51_Out-282746812|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-282746812, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-282746812} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-282746812, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-282746812|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-282746812} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 03:05:22,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-464817903 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-464817903 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-464817903 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-464817903 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-464817903 |ULTIMATE.start_main_#t~ite52_Out-464817903|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-464817903|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-464817903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-464817903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-464817903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-464817903} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-464817903|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-464817903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-464817903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-464817903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-464817903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 03:05:22,033 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 03:05:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:05:22 BasicIcfg [2019-12-27 03:05:22,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:05:22,124 INFO L168 Benchmark]: Toolchain (without parser) took 124239.40 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.2 MB in the beginning and 1.0 GB in the end (delta: -906.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,125 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.83 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 157.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.03 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,126 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,127 INFO L168 Benchmark]: RCFGBuilder took 881.86 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 101.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,128 INFO L168 Benchmark]: TraceAbstraction took 122486.11 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -907.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 03:05:22,130 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.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.83 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 157.2 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.03 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.86 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 101.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122486.11 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 1.0 GB in the end (delta: -907.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 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.1s, 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(&t1567, ((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(&t1568, ((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(&t1569, ((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: 122.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7422 SDtfs, 8759 SDslu, 30273 SDs, 0 SdLazy, 27133 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 5.6s 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: 36.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 259763 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1387 NumberOfCodeBlocks, 1387 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1293 ConstructedInterpolants, 0 QuantifiedInterpolants, 338130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...