/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/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:19:52,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:19:52,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:19:52,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:19:52,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:19:52,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:19:52,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:19:52,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:19:52,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:19:52,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:19:52,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:19:52,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:19:52,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:19:52,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:19:52,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:19:52,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:19:52,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:19:52,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:19:52,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:19:52,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:19:52,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:19:52,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:19:52,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:19:52,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:19:52,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:19:52,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:19:52,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:19:52,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:19:52,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:19:52,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:19:52,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:19:52,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:19:52,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:19:52,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:19:52,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:19:52,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:19:52,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:19:52,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:19:52,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:19:52,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:19:52,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:19:52,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:19:52,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:19:52,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:19:52,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:19:52,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:19:52,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:19:52,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:19:52,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:19:52,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:19:52,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:19:52,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:19:52,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:19:52,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:19:52,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:19:52,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:19:52,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:19:52,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:19:52,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:19:52,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:19:52,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:19:52,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:19:52,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:19:52,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:19:52,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:19:52,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:19:52,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:19:52,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:19:52,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:19:52,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:19:52,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:19:52,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:19:52,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:19:52,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:19:52,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:19:52,944 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:19:52,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-27 02:19:53,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c017efb/4ba0d71c9aa0473eab7189498ed06f3d/FLAG6b8e9b47e [2019-12-27 02:19:53,570 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:19:53,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-27 02:19:53,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c017efb/4ba0d71c9aa0473eab7189498ed06f3d/FLAG6b8e9b47e [2019-12-27 02:19:53,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c017efb/4ba0d71c9aa0473eab7189498ed06f3d [2019-12-27 02:19:53,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:19:53,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:19:53,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:19:53,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:19:53,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:19:53,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:19:53" (1/1) ... [2019-12-27 02:19:53,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:53, skipping insertion in model container [2019-12-27 02:19:53,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:19:53" (1/1) ... [2019-12-27 02:19:53,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:19:53,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:19:54,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:19:54,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:19:54,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:19:54,634 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:19:54,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54 WrapperNode [2019-12-27 02:19:54,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:19:54,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:19:54,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:19:54,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:19:54,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:19:54,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:19:54,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:19:54,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:19:54,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... [2019-12-27 02:19:54,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:19:54,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:19:54,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:19:54,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:19:54,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:19:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:19:54,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:19:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:19:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:19:54,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:19:54,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:19:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:19:54,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:19:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:19:54,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:19:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:19:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:19:54,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:19:54,837 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:19:55,601 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:19:55,601 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:19:55,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:19:55 BoogieIcfgContainer [2019-12-27 02:19:55,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:19:55,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:19:55,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:19:55,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:19:55,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:19:53" (1/3) ... [2019-12-27 02:19:55,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:19:55, skipping insertion in model container [2019-12-27 02:19:55,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:54" (2/3) ... [2019-12-27 02:19:55,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71f958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:19:55, skipping insertion in model container [2019-12-27 02:19:55,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:19:55" (3/3) ... [2019-12-27 02:19:55,611 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-27 02:19:55,621 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:19:55,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:19:55,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:19:55,632 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:19:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:55,781 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:19:55,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:19:55,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:19:55,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:19:55,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:19:55,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:19:55,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:19:55,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:19:55,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:19:55,818 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 02:19:55,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:19:55,924 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:19:55,924 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:19:55,943 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:19:55,975 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:19:56,034 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:19:56,034 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:19:56,047 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:19:56,076 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:19:56,077 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:20:01,356 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:20:01,501 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:20:01,669 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-27 02:20:01,670 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 02:20:01,674 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 02:20:20,343 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-27 02:20:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-27 02:20:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:20:20,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:20,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:20:20,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-27 02:20:20,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:20,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799887407] [2019-12-27 02:20:20,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:20,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799887407] [2019-12-27 02:20:20,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:20,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:20:20,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489508354] [2019-12-27 02:20:20,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:20,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:20,593 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-27 02:20:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:23,859 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-27 02:20:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:23,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:20:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:24,581 INFO L225 Difference]: With dead ends: 117122 [2019-12-27 02:20:24,582 INFO L226 Difference]: Without dead ends: 109842 [2019-12-27 02:20:24,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-27 02:20:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-27 02:20:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-27 02:20:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-27 02:20:37,920 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-27 02:20:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:37,920 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-27 02:20:37,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-27 02:20:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:20:37,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:37,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:37,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-27 02:20:37,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:37,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567824378] [2019-12-27 02:20:37,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:38,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567824378] [2019-12-27 02:20:38,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:38,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:38,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799297308] [2019-12-27 02:20:38,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:38,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:38,051 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-27 02:20:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:44,411 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-27 02:20:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:44,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:20:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:45,223 INFO L225 Difference]: With dead ends: 170700 [2019-12-27 02:20:45,224 INFO L226 Difference]: Without dead ends: 170651 [2019-12-27 02:20:45,224 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 02:20:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-27 02:20:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-27 02:20:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-27 02:20:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-27 02:20:55,599 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-27 02:20:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:55,600 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-27 02:20:55,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-27 02:20:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:20:55,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:55,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:55,608 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-27 02:20:55,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:55,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397836099] [2019-12-27 02:20:55,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:55,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397836099] [2019-12-27 02:20:55,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:55,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:55,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252947518] [2019-12-27 02:20:55,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:55,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:55,720 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-27 02:20:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:55,852 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-27 02:20:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:55,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:20:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:55,938 INFO L225 Difference]: With dead ends: 33806 [2019-12-27 02:20:55,939 INFO L226 Difference]: Without dead ends: 33806 [2019-12-27 02:20:55,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-27 02:20:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-27 02:20:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-27 02:20:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-27 02:20:56,664 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-27 02:20:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-27 02:20:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-27 02:20:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:20:56,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:56,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:56,669 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-27 02:20:56,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:56,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347237419] [2019-12-27 02:20:56,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:56,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347237419] [2019-12-27 02:20:56,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:56,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:56,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156302050] [2019-12-27 02:20:56,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:56,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:56,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:56,747 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-27 02:20:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:57,510 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-27 02:20:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:57,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:20:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:57,635 INFO L225 Difference]: With dead ends: 52205 [2019-12-27 02:20:57,635 INFO L226 Difference]: Without dead ends: 52205 [2019-12-27 02:20:57,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-27 02:20:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-27 02:20:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-27 02:20:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-27 02:20:58,395 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-27 02:20:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:58,396 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-27 02:20:58,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-27 02:20:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:20:58,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:58,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:58,399 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-27 02:20:58,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:58,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806615496] [2019-12-27 02:20:58,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:58,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806615496] [2019-12-27 02:20:58,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:58,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:58,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995083394] [2019-12-27 02:20:58,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:58,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:58,546 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-27 02:20:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:58,910 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-27 02:20:58,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:58,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:20:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:58,985 INFO L225 Difference]: With dead ends: 46485 [2019-12-27 02:20:58,985 INFO L226 Difference]: Without dead ends: 46485 [2019-12-27 02:20:58,985 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 02:20:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-27 02:21:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-27 02:21:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-27 02:21:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-27 02:21:00,128 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-27 02:21:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:00,129 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-27 02:21:00,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-27 02:21:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:21:00,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:00,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:00,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-27 02:21:00,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:00,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285844829] [2019-12-27 02:21:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:00,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285844829] [2019-12-27 02:21:00,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:00,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:00,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398169712] [2019-12-27 02:21:00,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:00,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:00,202 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-27 02:21:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:00,582 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-27 02:21:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:00,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:21:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:00,672 INFO L225 Difference]: With dead ends: 51005 [2019-12-27 02:21:00,672 INFO L226 Difference]: Without dead ends: 51005 [2019-12-27 02:21:00,673 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 02:21:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-27 02:21:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-27 02:21:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-27 02:21:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-27 02:21:02,127 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-27 02:21:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:02,127 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-27 02:21:02,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-27 02:21:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:21:02,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:02,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:02,138 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-27 02:21:02,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:02,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455861365] [2019-12-27 02:21:02,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:02,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455861365] [2019-12-27 02:21:02,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:02,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:02,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720500880] [2019-12-27 02:21:02,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:02,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:02,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:02,279 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-27 02:21:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:02,954 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-27 02:21:02,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:21:02,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:21:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:03,057 INFO L225 Difference]: With dead ends: 60565 [2019-12-27 02:21:03,058 INFO L226 Difference]: Without dead ends: 60558 [2019-12-27 02:21:03,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:21:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-27 02:21:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-27 02:21:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-27 02:21:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-27 02:21:03,960 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-27 02:21:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:03,961 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-27 02:21:03,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-27 02:21:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:21:03,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:03,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:03,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-27 02:21:03,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:03,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078921759] [2019-12-27 02:21:03,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:04,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078921759] [2019-12-27 02:21:04,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:04,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:04,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324826963] [2019-12-27 02:21:04,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:04,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:04,056 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-27 02:21:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:05,157 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-27 02:21:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:21:05,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:21:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:05,271 INFO L225 Difference]: With dead ends: 63360 [2019-12-27 02:21:05,271 INFO L226 Difference]: Without dead ends: 63353 [2019-12-27 02:21:05,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:21:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-27 02:21:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-27 02:21:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-27 02:21:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-27 02:21:06,182 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-27 02:21:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:06,182 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-27 02:21:06,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-27 02:21:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:21:06,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:06,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:06,195 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-27 02:21:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:06,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838352656] [2019-12-27 02:21:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:06,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838352656] [2019-12-27 02:21:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:06,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:06,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327449209] [2019-12-27 02:21:06,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:06,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:06,254 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-27 02:21:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:06,344 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-27 02:21:06,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:06,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:21:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:06,381 INFO L225 Difference]: With dead ends: 18121 [2019-12-27 02:21:06,382 INFO L226 Difference]: Without dead ends: 18121 [2019-12-27 02:21:06,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-27 02:21:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-27 02:21:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:21:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-27 02:21:06,658 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-27 02:21:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:06,660 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-27 02:21:06,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-27 02:21:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:21:06,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:06,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:06,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-27 02:21:06,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:06,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535178603] [2019-12-27 02:21:06,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:06,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535178603] [2019-12-27 02:21:06,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:06,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:06,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594938189] [2019-12-27 02:21:06,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:06,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:06,712 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-27 02:21:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:06,810 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-27 02:21:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:06,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:21:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:06,842 INFO L225 Difference]: With dead ends: 23499 [2019-12-27 02:21:06,843 INFO L226 Difference]: Without dead ends: 23499 [2019-12-27 02:21:06,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-27 02:21:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-27 02:21:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:21:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-27 02:21:07,400 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-27 02:21:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:07,400 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-27 02:21:07,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-27 02:21:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:21:07,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:07,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:07,414 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:07,414 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-27 02:21:07,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:07,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043810419] [2019-12-27 02:21:07,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:07,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043810419] [2019-12-27 02:21:07,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:07,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:07,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096088849] [2019-12-27 02:21:07,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:07,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:07,507 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-27 02:21:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:07,867 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-27 02:21:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:21:07,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:21:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:07,896 INFO L225 Difference]: With dead ends: 21964 [2019-12-27 02:21:07,897 INFO L226 Difference]: Without dead ends: 21964 [2019-12-27 02:21:07,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-27 02:21:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-27 02:21:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-27 02:21:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-27 02:21:08,215 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-27 02:21:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:08,215 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-27 02:21:08,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-27 02:21:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:21:08,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:08,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:08,230 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-27 02:21:08,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:08,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657650746] [2019-12-27 02:21:08,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:08,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657650746] [2019-12-27 02:21:08,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:08,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:08,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115864155] [2019-12-27 02:21:08,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:08,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:08,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:08,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:08,320 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-27 02:21:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:08,459 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-27 02:21:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:08,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:21:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:08,503 INFO L225 Difference]: With dead ends: 20911 [2019-12-27 02:21:08,503 INFO L226 Difference]: Without dead ends: 20911 [2019-12-27 02:21:08,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-27 02:21:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-27 02:21:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-27 02:21:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-27 02:21:08,931 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-27 02:21:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:08,931 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-27 02:21:08,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-27 02:21:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:21:08,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:08,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:08,950 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:08,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-27 02:21:08,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:08,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062538678] [2019-12-27 02:21:08,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:09,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062538678] [2019-12-27 02:21:09,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:09,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:09,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597681841] [2019-12-27 02:21:09,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:09,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:09,031 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-27 02:21:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:09,430 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-27 02:21:09,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:21:09,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 02:21:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:09,463 INFO L225 Difference]: With dead ends: 24383 [2019-12-27 02:21:09,463 INFO L226 Difference]: Without dead ends: 24383 [2019-12-27 02:21:09,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-27 02:21:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-27 02:21:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-27 02:21:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-27 02:21:09,815 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-27 02:21:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:09,815 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-27 02:21:09,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-27 02:21:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:21:09,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:09,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:09,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-27 02:21:09,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:09,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480971924] [2019-12-27 02:21:09,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:10,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480971924] [2019-12-27 02:21:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:10,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:10,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049023296] [2019-12-27 02:21:10,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:10,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:10,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:10,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:10,216 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-27 02:21:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:11,010 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-27 02:21:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:21:11,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:21:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:11,048 INFO L225 Difference]: With dead ends: 27860 [2019-12-27 02:21:11,049 INFO L226 Difference]: Without dead ends: 27860 [2019-12-27 02:21:11,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:21:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-27 02:21:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-27 02:21:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-27 02:21:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-27 02:21:11,447 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-27 02:21:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:11,448 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-27 02:21:11,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-27 02:21:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:21:11,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:11,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:11,467 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-27 02:21:11,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:11,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644971118] [2019-12-27 02:21:11,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:11,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644971118] [2019-12-27 02:21:11,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:11,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:11,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518501315] [2019-12-27 02:21:11,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:11,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:11,557 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-27 02:21:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:12,330 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-27 02:21:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:21:12,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 02:21:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:12,379 INFO L225 Difference]: With dead ends: 27029 [2019-12-27 02:21:12,380 INFO L226 Difference]: Without dead ends: 27029 [2019-12-27 02:21:12,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:21:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-27 02:21:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-27 02:21:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-27 02:21:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-27 02:21:12,736 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-27 02:21:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:12,737 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-27 02:21:12,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-27 02:21:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:21:12,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:12,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:12,754 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-27 02:21:12,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:12,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372113430] [2019-12-27 02:21:12,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:12,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372113430] [2019-12-27 02:21:12,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:12,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:21:12,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538666148] [2019-12-27 02:21:12,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:12,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:12,810 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-27 02:21:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:12,884 INFO L93 Difference]: Finished difference Result 19089 states and 56685 transitions. [2019-12-27 02:21:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:12,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:21:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:12,917 INFO L225 Difference]: With dead ends: 19089 [2019-12-27 02:21:12,917 INFO L226 Difference]: Without dead ends: 19089 [2019-12-27 02:21:12,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19089 states. [2019-12-27 02:21:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19089 to 19089. [2019-12-27 02:21:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19089 states. [2019-12-27 02:21:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 56685 transitions. [2019-12-27 02:21:13,247 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 56685 transitions. Word has length 39 [2019-12-27 02:21:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:13,248 INFO L462 AbstractCegarLoop]: Abstraction has 19089 states and 56685 transitions. [2019-12-27 02:21:13,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 56685 transitions. [2019-12-27 02:21:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:21:13,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:13,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:13,271 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-27 02:21:13,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:13,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984773523] [2019-12-27 02:21:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:13,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984773523] [2019-12-27 02:21:13,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:13,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:13,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080889433] [2019-12-27 02:21:13,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:13,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:13,348 INFO L87 Difference]: Start difference. First operand 19089 states and 56685 transitions. Second operand 5 states. [2019-12-27 02:21:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:14,214 INFO L93 Difference]: Finished difference Result 27483 states and 80802 transitions. [2019-12-27 02:21:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:21:14,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:21:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:14,252 INFO L225 Difference]: With dead ends: 27483 [2019-12-27 02:21:14,252 INFO L226 Difference]: Without dead ends: 27483 [2019-12-27 02:21:14,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2019-12-27 02:21:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 25378. [2019-12-27 02:21:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25378 states. [2019-12-27 02:21:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25378 states to 25378 states and 75084 transitions. [2019-12-27 02:21:14,671 INFO L78 Accepts]: Start accepts. Automaton has 25378 states and 75084 transitions. Word has length 40 [2019-12-27 02:21:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:14,671 INFO L462 AbstractCegarLoop]: Abstraction has 25378 states and 75084 transitions. [2019-12-27 02:21:14,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25378 states and 75084 transitions. [2019-12-27 02:21:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:21:14,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:14,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:14,694 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-27 02:21:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:14,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114632584] [2019-12-27 02:21:14,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:14,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114632584] [2019-12-27 02:21:14,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:14,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:14,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100612488] [2019-12-27 02:21:14,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:14,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:14,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:14,779 INFO L87 Difference]: Start difference. First operand 25378 states and 75084 transitions. Second operand 3 states. [2019-12-27 02:21:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:14,894 INFO L93 Difference]: Finished difference Result 25378 states and 75005 transitions. [2019-12-27 02:21:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:14,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 02:21:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:14,946 INFO L225 Difference]: With dead ends: 25378 [2019-12-27 02:21:14,946 INFO L226 Difference]: Without dead ends: 25378 [2019-12-27 02:21:14,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-27 02:21:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21127. [2019-12-27 02:21:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21127 states. [2019-12-27 02:21:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21127 states to 21127 states and 63266 transitions. [2019-12-27 02:21:15,656 INFO L78 Accepts]: Start accepts. Automaton has 21127 states and 63266 transitions. Word has length 40 [2019-12-27 02:21:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:15,657 INFO L462 AbstractCegarLoop]: Abstraction has 21127 states and 63266 transitions. [2019-12-27 02:21:15,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 21127 states and 63266 transitions. [2019-12-27 02:21:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:21:15,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:15,686 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] [2019-12-27 02:21:15,686 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash -559165763, now seen corresponding path program 1 times [2019-12-27 02:21:15,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:15,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048503763] [2019-12-27 02:21:15,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:15,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048503763] [2019-12-27 02:21:15,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:15,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:15,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328181531] [2019-12-27 02:21:15,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:15,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:15,739 INFO L87 Difference]: Start difference. First operand 21127 states and 63266 transitions. Second operand 5 states. [2019-12-27 02:21:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:15,839 INFO L93 Difference]: Finished difference Result 19886 states and 60599 transitions. [2019-12-27 02:21:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:15,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 02:21:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:15,877 INFO L225 Difference]: With dead ends: 19886 [2019-12-27 02:21:15,877 INFO L226 Difference]: Without dead ends: 19886 [2019-12-27 02:21:15,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2019-12-27 02:21:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 19886. [2019-12-27 02:21:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19886 states. [2019-12-27 02:21:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19886 states to 19886 states and 60599 transitions. [2019-12-27 02:21:16,239 INFO L78 Accepts]: Start accepts. Automaton has 19886 states and 60599 transitions. Word has length 41 [2019-12-27 02:21:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:16,239 INFO L462 AbstractCegarLoop]: Abstraction has 19886 states and 60599 transitions. [2019-12-27 02:21:16,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19886 states and 60599 transitions. [2019-12-27 02:21:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:21:16,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:16,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:16,260 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-27 02:21:16,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:16,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116294097] [2019-12-27 02:21:16,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:16,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116294097] [2019-12-27 02:21:16,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:16,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:16,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331619587] [2019-12-27 02:21:16,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:16,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:16,347 INFO L87 Difference]: Start difference. First operand 19886 states and 60599 transitions. Second operand 7 states. [2019-12-27 02:21:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:16,927 INFO L93 Difference]: Finished difference Result 56173 states and 169762 transitions. [2019-12-27 02:21:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:21:16,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:21:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:17,006 INFO L225 Difference]: With dead ends: 56173 [2019-12-27 02:21:17,006 INFO L226 Difference]: Without dead ends: 43296 [2019-12-27 02:21:17,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:21:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43296 states. [2019-12-27 02:21:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43296 to 23308. [2019-12-27 02:21:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23308 states. [2019-12-27 02:21:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23308 states to 23308 states and 71016 transitions. [2019-12-27 02:21:17,799 INFO L78 Accepts]: Start accepts. Automaton has 23308 states and 71016 transitions. Word has length 65 [2019-12-27 02:21:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:17,799 INFO L462 AbstractCegarLoop]: Abstraction has 23308 states and 71016 transitions. [2019-12-27 02:21:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 23308 states and 71016 transitions. [2019-12-27 02:21:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:21:17,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:17,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:17,827 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1989977016, now seen corresponding path program 2 times [2019-12-27 02:21:17,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:17,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501221369] [2019-12-27 02:21:17,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:17,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 02:21:17,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501221369] [2019-12-27 02:21:17,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:17,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:17,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275631926] [2019-12-27 02:21:17,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:17,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:17,911 INFO L87 Difference]: Start difference. First operand 23308 states and 71016 transitions. Second operand 7 states. [2019-12-27 02:21:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:18,446 INFO L93 Difference]: Finished difference Result 62282 states and 186068 transitions. [2019-12-27 02:21:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:21:18,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:21:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:18,508 INFO L225 Difference]: With dead ends: 62282 [2019-12-27 02:21:18,508 INFO L226 Difference]: Without dead ends: 44545 [2019-12-27 02:21:18,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:21:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44545 states. [2019-12-27 02:21:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44545 to 27350. [2019-12-27 02:21:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27350 states. [2019-12-27 02:21:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 82398 transitions. [2019-12-27 02:21:19,096 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 82398 transitions. Word has length 65 [2019-12-27 02:21:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:19,097 INFO L462 AbstractCegarLoop]: Abstraction has 27350 states and 82398 transitions. [2019-12-27 02:21:19,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 82398 transitions. [2019-12-27 02:21:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:21:19,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:19,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:19,125 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 3 times [2019-12-27 02:21:19,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:19,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136685278] [2019-12-27 02:21:19,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:19,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136685278] [2019-12-27 02:21:19,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:19,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:19,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659199030] [2019-12-27 02:21:19,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:19,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:19,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:19,208 INFO L87 Difference]: Start difference. First operand 27350 states and 82398 transitions. Second operand 7 states. [2019-12-27 02:21:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:19,800 INFO L93 Difference]: Finished difference Result 54026 states and 160947 transitions. [2019-12-27 02:21:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:21:19,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:21:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:19,888 INFO L225 Difference]: With dead ends: 54026 [2019-12-27 02:21:19,888 INFO L226 Difference]: Without dead ends: 47313 [2019-12-27 02:21:19,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:21:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47313 states. [2019-12-27 02:21:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47313 to 27658. [2019-12-27 02:21:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27658 states. [2019-12-27 02:21:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27658 states to 27658 states and 83349 transitions. [2019-12-27 02:21:20,826 INFO L78 Accepts]: Start accepts. Automaton has 27658 states and 83349 transitions. Word has length 65 [2019-12-27 02:21:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:20,826 INFO L462 AbstractCegarLoop]: Abstraction has 27658 states and 83349 transitions. [2019-12-27 02:21:20,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 27658 states and 83349 transitions. [2019-12-27 02:21:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:21:20,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:20,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:20,856 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-27 02:21:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:20,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501919048] [2019-12-27 02:21:20,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:20,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501919048] [2019-12-27 02:21:20,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:20,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:20,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375727205] [2019-12-27 02:21:20,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:20,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:20,915 INFO L87 Difference]: Start difference. First operand 27658 states and 83349 transitions. Second operand 3 states. [2019-12-27 02:21:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:21,122 INFO L93 Difference]: Finished difference Result 30812 states and 92747 transitions. [2019-12-27 02:21:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:21,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:21:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:21,194 INFO L225 Difference]: With dead ends: 30812 [2019-12-27 02:21:21,194 INFO L226 Difference]: Without dead ends: 30812 [2019-12-27 02:21:21,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30812 states. [2019-12-27 02:21:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30812 to 25037. [2019-12-27 02:21:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25037 states. [2019-12-27 02:21:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25037 states to 25037 states and 76106 transitions. [2019-12-27 02:21:21,714 INFO L78 Accepts]: Start accepts. Automaton has 25037 states and 76106 transitions. Word has length 65 [2019-12-27 02:21:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:21,715 INFO L462 AbstractCegarLoop]: Abstraction has 25037 states and 76106 transitions. [2019-12-27 02:21:21,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25037 states and 76106 transitions. [2019-12-27 02:21:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:21:21,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:21,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:21,740 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-27 02:21:21,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:21,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440644604] [2019-12-27 02:21:21,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:21,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440644604] [2019-12-27 02:21:21,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:21,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:21,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29434336] [2019-12-27 02:21:21,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:21,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:21,804 INFO L87 Difference]: Start difference. First operand 25037 states and 76106 transitions. Second operand 3 states. [2019-12-27 02:21:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:21,889 INFO L93 Difference]: Finished difference Result 20969 states and 62663 transitions. [2019-12-27 02:21:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:21,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:21:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:21,915 INFO L225 Difference]: With dead ends: 20969 [2019-12-27 02:21:21,915 INFO L226 Difference]: Without dead ends: 20969 [2019-12-27 02:21:21,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20969 states. [2019-12-27 02:21:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20969 to 19009. [2019-12-27 02:21:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19009 states. [2019-12-27 02:21:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19009 states to 19009 states and 56843 transitions. [2019-12-27 02:21:22,207 INFO L78 Accepts]: Start accepts. Automaton has 19009 states and 56843 transitions. Word has length 66 [2019-12-27 02:21:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:22,208 INFO L462 AbstractCegarLoop]: Abstraction has 19009 states and 56843 transitions. [2019-12-27 02:21:22,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19009 states and 56843 transitions. [2019-12-27 02:21:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:21:22,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:22,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:22,226 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 02:21:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-27 02:21:22,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:22,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024717267] [2019-12-27 02:21:22,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:21:22,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024717267] [2019-12-27 02:21:22,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:22,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:21:22,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420047873] [2019-12-27 02:21:22,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:21:22,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:22,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:21:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:22,387 INFO L87 Difference]: Start difference. First operand 19009 states and 56843 transitions. Second operand 11 states. [2019-12-27 02:21:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:23,654 INFO L93 Difference]: Finished difference Result 43638 states and 129396 transitions. [2019-12-27 02:21:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 02:21:23,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:21:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:23,699 INFO L225 Difference]: With dead ends: 43638 [2019-12-27 02:21:23,699 INFO L226 Difference]: Without dead ends: 32919 [2019-12-27 02:21:23,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:21:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32919 states. [2019-12-27 02:21:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32919 to 18279. [2019-12-27 02:21:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-12-27 02:21:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 54342 transitions. [2019-12-27 02:21:24,351 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 54342 transitions. Word has length 67 [2019-12-27 02:21:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:24,352 INFO L462 AbstractCegarLoop]: Abstraction has 18279 states and 54342 transitions. [2019-12-27 02:21:24,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:21:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 54342 transitions. [2019-12-27 02:21:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:21:24,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:24,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:24,372 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 02:21:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-27 02:21:24,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:24,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940872387] [2019-12-27 02:21:24,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:24,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:21:24,541 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:21:24,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30|) |v_ULTIMATE.start_main_~#t931~0.offset_22| 0)) |v_#memory_int_19|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30| 1)) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_22|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_30| 4)) (= v_~a$mem_tmp~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30|) 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_23|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_30|, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_17|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_13|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 02:21:24,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~x~0_In-1533835550 ~__unbuffered_p0_EAX~0_Out-1533835550) (= ~a$r_buff1_thd2~0_Out-1533835550 ~a$r_buff0_thd2~0_In-1533835550) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1533835550)) (= 1 ~a$r_buff0_thd1~0_Out-1533835550) (= ~a$r_buff0_thd0~0_In-1533835550 ~a$r_buff1_thd0~0_Out-1533835550) (= ~a$r_buff0_thd1~0_In-1533835550 ~a$r_buff1_thd1~0_Out-1533835550) (= ~a$r_buff1_thd3~0_Out-1533835550 ~a$r_buff0_thd3~0_In-1533835550)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1533835550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1533835550, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1533835550, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1533835550, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1533835550, ~x~0=~x~0_In-1533835550} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1533835550, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1533835550, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1533835550, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1533835550, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1533835550, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1533835550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1533835550, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1533835550, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1533835550, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1533835550, ~x~0=~x~0_In-1533835550} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:21:24,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-27 02:21:24,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-27 02:21:24,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-2134926600 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-2134926600 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2134926600| ~a~0_In-2134926600) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2134926600| ~a$w_buff1~0_In-2134926600) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-2134926600, ~a$w_buff1~0=~a$w_buff1~0_In-2134926600, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2134926600, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2134926600} OutVars{~a~0=~a~0_In-2134926600, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2134926600|, ~a$w_buff1~0=~a$w_buff1~0_In-2134926600, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2134926600, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2134926600} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:21:24,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 02:21:24,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1302173294 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1302173294 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1302173294| ~a$w_buff0_used~0_In1302173294)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1302173294|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1302173294, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1302173294} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1302173294, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1302173294, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1302173294|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:21:24,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1552736590 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1552736590 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1552736590 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1552736590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1552736590|)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1552736590| ~a$w_buff1_used~0_In-1552736590) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1552736590, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1552736590, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1552736590|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:21:24,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In366592445 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In366592445 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out366592445| ~a$r_buff0_thd2~0_In366592445) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out366592445| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In366592445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In366592445} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In366592445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In366592445, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out366592445|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:21:24,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1336485563 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1336485563 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1336485563 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1336485563 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1336485563| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1336485563| ~a$r_buff1_thd2~0_In-1336485563) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1336485563, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1336485563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1336485563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1336485563} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1336485563, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1336485563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1336485563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1336485563, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1336485563|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:21:24,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:21:24,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1290268144 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1290268144 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1290268144| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1290268144| ~a$w_buff0_used~0_In-1290268144)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1290268144, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1290268144} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1290268144|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1290268144, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1290268144} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:21:24,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In2090061351 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In2090061351 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In2090061351 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2090061351 256)))) (or (and (= ~a$w_buff1_used~0_In2090061351 |P0Thread1of1ForFork1_#t~ite6_Out2090061351|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2090061351|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2090061351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2090061351, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2090061351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2090061351} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2090061351|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2090061351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2090061351, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2090061351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2090061351} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:21:24,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-469316566 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-469316566 256)))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-469316566 0)) (and (= ~a$r_buff0_thd1~0_Out-469316566 ~a$r_buff0_thd1~0_In-469316566) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-469316566, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-469316566} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-469316566|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-469316566, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-469316566} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:21:24,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-1833252306 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1833252306 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1833252306 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1833252306 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1833252306| ~a$r_buff1_thd1~0_In-1833252306) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1833252306| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1833252306, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1833252306, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1833252306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1833252306} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1833252306|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1833252306, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1833252306, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1833252306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1833252306} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:21:24,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:21:24,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1135459090 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1135459090| |P2Thread1of1ForFork0_#t~ite29_Out-1135459090|) (= ~a$w_buff1_used~0_In-1135459090 |P2Thread1of1ForFork0_#t~ite30_Out-1135459090|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1135459090| |P2Thread1of1ForFork0_#t~ite30_Out-1135459090|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1135459090 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1135459090 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In-1135459090 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1135459090 256)))) (= ~a$w_buff1_used~0_In-1135459090 |P2Thread1of1ForFork0_#t~ite29_Out-1135459090|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1135459090, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1135459090, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1135459090, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1135459090, ~weak$$choice2~0=~weak$$choice2~0_In-1135459090, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1135459090|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1135459090, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1135459090, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1135459090, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1135459090, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1135459090|, ~weak$$choice2~0=~weak$$choice2~0_In-1135459090, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1135459090|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 02:21:24,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:21:24,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 02:21:24,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1179181527 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1179181527 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1179181527| ~a$w_buff1~0_In1179181527) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1179181527| ~a~0_In1179181527)))) InVars {~a~0=~a~0_In1179181527, ~a$w_buff1~0=~a$w_buff1~0_In1179181527, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1179181527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1179181527} OutVars{~a~0=~a~0_In1179181527, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1179181527|, ~a$w_buff1~0=~a$w_buff1~0_In1179181527, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1179181527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1179181527} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:21:24,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:21:24,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In903350409 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In903350409 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In903350409 |P2Thread1of1ForFork0_#t~ite40_Out903350409|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out903350409|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In903350409, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In903350409} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out903350409|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In903350409, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In903350409} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:21:24,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1971677690 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1971677690 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1971677690 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1971677690 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1971677690|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1971677690| ~a$w_buff1_used~0_In-1971677690)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1971677690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1971677690, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1971677690, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1971677690} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1971677690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1971677690, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1971677690, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1971677690, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1971677690|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:21:24,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In677590945 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In677590945 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out677590945|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd3~0_In677590945 |P2Thread1of1ForFork0_#t~ite42_Out677590945|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In677590945, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In677590945} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In677590945, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In677590945, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out677590945|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:21:24,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-852017631 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-852017631 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-852017631 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-852017631 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-852017631| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-852017631 |P2Thread1of1ForFork0_#t~ite43_Out-852017631|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-852017631|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:21:24,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:21:24,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:21:24,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1671439504| |ULTIMATE.start_main_#t~ite48_Out-1671439504|)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1671439504 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1671439504 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1671439504| ~a~0_In-1671439504)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1671439504| ~a$w_buff1~0_In-1671439504) (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In-1671439504, ~a$w_buff1~0=~a$w_buff1~0_In-1671439504, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1671439504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1671439504} OutVars{~a~0=~a~0_In-1671439504, ~a$w_buff1~0=~a$w_buff1~0_In-1671439504, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1671439504|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1671439504, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1671439504|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1671439504} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:21:24,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In660041933 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In660041933 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out660041933| ~a$w_buff0_used~0_In660041933)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out660041933| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In660041933, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In660041933} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In660041933, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out660041933|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In660041933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:21:24,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In-1392112939 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1392112939 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1392112939 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1392112939 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1392112939| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1392112939 |ULTIMATE.start_main_#t~ite50_Out-1392112939|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1392112939, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1392112939, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1392112939, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1392112939} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1392112939|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1392112939, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1392112939, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1392112939, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1392112939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:21:24,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1353326776 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1353326776 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1353326776|)) (and (= ~a$r_buff0_thd0~0_In1353326776 |ULTIMATE.start_main_#t~ite51_Out1353326776|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1353326776} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1353326776|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1353326776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:21:24,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In-625372375 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-625372375 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-625372375 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-625372375 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-625372375| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-625372375| ~a$r_buff1_thd0~0_In-625372375) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-625372375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-625372375, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-625372375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-625372375} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-625372375|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-625372375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-625372375, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-625372375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-625372375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:21:24,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:21:24,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:21:24 BasicIcfg [2019-12-27 02:21:24,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:21:24,713 INFO L168 Benchmark]: Toolchain (without parser) took 90874.35 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,713 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.30 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,715 INFO L168 Benchmark]: Boogie Preprocessor took 55.41 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,715 INFO L168 Benchmark]: RCFGBuilder took 841.38 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,721 INFO L168 Benchmark]: TraceAbstraction took 89104.53 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:21:24,723 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.30 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.41 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.38 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89104.53 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5301 SDtfs, 5052 SDslu, 13485 SDs, 0 SdLazy, 4937 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 184051 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 139489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...