/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:49:34,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:49:34,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:49:34,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:49:34,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:49:34,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:49:34,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:49:34,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:49:34,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:49:34,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:49:34,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:49:34,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:49:34,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:49:34,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:49:34,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:49:34,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:49:34,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:49:34,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:49:34,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:49:34,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:49:34,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:49:34,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:49:34,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:49:34,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:49:34,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:49:34,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:49:34,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:49:34,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:49:34,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:49:34,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:49:34,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:49:34,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:49:34,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:49:34,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:49:34,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:49:34,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:49:34,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:49:34,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:49:34,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:49:34,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:49:34,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:49:34,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:49:34,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:49:34,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:49:34,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:49:34,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:49:34,670 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:49:34,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:49:34,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:49:34,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:49:34,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:49:34,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:49:34,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:49:34,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:49:34,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:49:34,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:49:34,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:49:34,674 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:49:34,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:49:34,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:49:34,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:49:34,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:49:34,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:49:34,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:49:34,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:49:34,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:49:34,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:49:34,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:49:34,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:49:34,676 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:49:34,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:49:34,676 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:49:34,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:49:34,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:49:34,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:49:34,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:49:34,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:49:34,975 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:49:34,975 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 16:49:35,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614472568/b2058ac7a72244bdadabdc844728dad1/FLAG756313bd6 [2019-12-27 16:49:35,624 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:49:35,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2019-12-27 16:49:35,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614472568/b2058ac7a72244bdadabdc844728dad1/FLAG756313bd6 [2019-12-27 16:49:35,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614472568/b2058ac7a72244bdadabdc844728dad1 [2019-12-27 16:49:35,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:49:35,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:49:35,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:35,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:49:35,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:49:35,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:35" (1/1) ... [2019-12-27 16:49:35,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e917af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:35, skipping insertion in model container [2019-12-27 16:49:35,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:35" (1/1) ... [2019-12-27 16:49:35,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:49:35,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:49:36,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:36,556 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:49:36,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:36,718 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:49:36,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36 WrapperNode [2019-12-27 16:49:36,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:36,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:36,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:49:36,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:49:36,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:36,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:49:36,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:49:36,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:49:36,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (1/1) ... [2019-12-27 16:49:36,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:49:36,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:49:36,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:49:36,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:49:36,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (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 16:49:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:49:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:49:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:49:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:49:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:49:36,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:49:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:49:36,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:49:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:49:36,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:49:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:49:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:49:36,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:49:36,925 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 16:49:37,914 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:49:37,915 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:49:37,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:37 BoogieIcfgContainer [2019-12-27 16:49:37,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:49:37,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:49:37,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:49:37,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:49:37,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:49:35" (1/3) ... [2019-12-27 16:49:37,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa0a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:37, skipping insertion in model container [2019-12-27 16:49:37,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:36" (2/3) ... [2019-12-27 16:49:37,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa0a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:37, skipping insertion in model container [2019-12-27 16:49:37,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:37" (3/3) ... [2019-12-27 16:49:37,925 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-27 16:49:37,936 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:49:37,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:49:37,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:49:37,946 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:49:37,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,029 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,029 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,037 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,078 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,078 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:38,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:49:38,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:49:38,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:49:38,113 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:49:38,113 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:49:38,113 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:49:38,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:49:38,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:49:38,114 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:49:38,131 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 16:49:38,133 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:49:38,238 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:49:38,239 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:38,257 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 16:49:38,286 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:49:38,344 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:49:38,344 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:38,354 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 16:49:38,378 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:49:38,379 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:49:43,855 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:49:44,005 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:49:44,149 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-27 16:49:44,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 16:49:44,153 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 16:50:03,190 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-27 16:50:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-27 16:50:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:50:03,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:03,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:50:03,199 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 16:50:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-27 16:50:03,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:03,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599536596] [2019-12-27 16:50:03,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:03,433 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 16:50:03,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599536596] [2019-12-27 16:50:03,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:03,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:50:03,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833678514] [2019-12-27 16:50:03,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:03,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:03,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:50:03,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:03,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:03,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:03,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:03,476 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-27 16:50:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:04,703 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-27 16:50:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:04,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:50:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:08,417 INFO L225 Difference]: With dead ends: 117122 [2019-12-27 16:50:08,417 INFO L226 Difference]: Without dead ends: 109842 [2019-12-27 16:50:08,419 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 16:50:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-27 16:50:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-27 16:50:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-27 16:50:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-27 16:50:19,445 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-27 16:50:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:19,445 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-27 16:50:19,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-27 16:50:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:50:19,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:19,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:19,450 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 16:50:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-27 16:50:19,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169619507] [2019-12-27 16:50:19,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:19,622 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 16:50:19,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169619507] [2019-12-27 16:50:19,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:19,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:19,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157781338] [2019-12-27 16:50:19,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:19,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:19,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:50:19,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:19,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:19,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:19,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:19,631 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-27 16:50:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:24,897 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-27 16:50:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:24,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:50:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:25,643 INFO L225 Difference]: With dead ends: 170700 [2019-12-27 16:50:25,644 INFO L226 Difference]: Without dead ends: 170651 [2019-12-27 16:50:25,645 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 16:50:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-27 16:50:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-27 16:50:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-27 16:50:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-27 16:50:35,904 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-27 16:50:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:35,904 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-27 16:50:35,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-27 16:50:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:50:35,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:35,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:35,911 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 16:50:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-27 16:50:40,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:40,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130358977] [2019-12-27 16:50:40,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:40,585 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 16:50:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130358977] [2019-12-27 16:50:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333476464] [2019-12-27 16:50:40,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:40,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:40,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:50:40,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:40,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:40,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:40,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:40,597 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-27 16:50:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:40,747 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-27 16:50:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:40,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:50:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:40,813 INFO L225 Difference]: With dead ends: 33806 [2019-12-27 16:50:40,813 INFO L226 Difference]: Without dead ends: 33806 [2019-12-27 16:50:40,813 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 16:50:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-27 16:50:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-27 16:50:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-27 16:50:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-27 16:50:41,560 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-27 16:50:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:41,560 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-27 16:50:41,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-27 16:50:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:50:41,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:41,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:41,564 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 16:50:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-27 16:50:41,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:41,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704762165] [2019-12-27 16:50:41,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:41,652 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 16:50:41,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704762165] [2019-12-27 16:50:41,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:41,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:41,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057259748] [2019-12-27 16:50:41,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:41,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:41,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:50:41,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:41,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:41,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:41,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:41,660 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-27 16:50:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:41,889 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-27 16:50:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:41,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:50:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:41,977 INFO L225 Difference]: With dead ends: 52205 [2019-12-27 16:50:41,978 INFO L226 Difference]: Without dead ends: 52205 [2019-12-27 16:50:41,978 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 16:50:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-27 16:50:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-27 16:50:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-27 16:50:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-27 16:50:43,149 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-27 16:50:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:43,150 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-27 16:50:43,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-27 16:50:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:50:43,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:43,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:43,154 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 16:50:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-27 16:50:43,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:43,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404887044] [2019-12-27 16:50:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:43,237 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 16:50:43,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404887044] [2019-12-27 16:50:43,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1929337035] [2019-12-27 16:50:43,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:43,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:43,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:50:43,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:43,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:43,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:43,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:43,245 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-27 16:50:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:43,590 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-27 16:50:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:43,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:50:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:43,664 INFO L225 Difference]: With dead ends: 46485 [2019-12-27 16:50:43,664 INFO L226 Difference]: Without dead ends: 46485 [2019-12-27 16:50:43,664 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 16:50:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-27 16:50:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-27 16:50:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-27 16:50:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-27 16:50:44,690 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-27 16:50:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:44,690 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-27 16:50:44,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-27 16:50:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:50:44,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:44,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:44,694 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 16:50:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-27 16:50:44,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:44,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179692516] [2019-12-27 16:50:44,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:44,762 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 16:50:44,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179692516] [2019-12-27 16:50:44,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:44,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:44,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368955272] [2019-12-27 16:50:44,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:44,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:44,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:50:44,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:44,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:44,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:44,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:44,773 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-27 16:50:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:45,136 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-27 16:50:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:45,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:50:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:45,219 INFO L225 Difference]: With dead ends: 51005 [2019-12-27 16:50:45,219 INFO L226 Difference]: Without dead ends: 51005 [2019-12-27 16:50:45,219 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 16:50:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-27 16:50:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-27 16:50:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-27 16:50:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-27 16:50:46,529 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-27 16:50:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:46,529 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-27 16:50:46,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-27 16:50:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:50:46,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:46,539 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 16:50:46,539 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 16:50:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-27 16:50:46,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:46,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15955082] [2019-12-27 16:50:46,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:46,630 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 16:50:46,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15955082] [2019-12-27 16:50:46,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:46,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:46,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873292253] [2019-12-27 16:50:46,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:46,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:46,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:50:46,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:46,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:46,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:50:46,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:50:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:50:46,698 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 6 states. [2019-12-27 16:50:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:47,473 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-27 16:50:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:50:47,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 16:50:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:47,573 INFO L225 Difference]: With dead ends: 60565 [2019-12-27 16:50:47,573 INFO L226 Difference]: Without dead ends: 60558 [2019-12-27 16:50:47,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:50:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-27 16:50:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-27 16:50:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-27 16:50:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-27 16:50:48,949 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-27 16:50:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:48,950 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-27 16:50:48,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:50:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-27 16:50:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:50:48,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:48,960 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 16:50:48,960 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 16:50:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-27 16:50:48,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:48,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56574167] [2019-12-27 16:50:48,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:49,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 16:50:49,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56574167] [2019-12-27 16:50:49,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:49,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:49,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296173309] [2019-12-27 16:50:49,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:49,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:49,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:50:49,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:49,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:49,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:50:49,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:50:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:50:49,085 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 6 states. [2019-12-27 16:50:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:49,844 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-27 16:50:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:50:49,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 16:50:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:49,962 INFO L225 Difference]: With dead ends: 63360 [2019-12-27 16:50:49,962 INFO L226 Difference]: Without dead ends: 63353 [2019-12-27 16:50:49,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:50:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-27 16:50:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-27 16:50:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-27 16:50:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-27 16:50:50,907 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-27 16:50:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:50,908 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-27 16:50:50,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:50:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-27 16:50:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:50:50,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:50,920 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 16:50:50,920 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 16:50:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-27 16:50:50,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:50,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404768416] [2019-12-27 16:50:50,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:50,965 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 16:50:50,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404768416] [2019-12-27 16:50:50,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:50,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:50,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519366060] [2019-12-27 16:50:50,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:50,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:50,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:50:50,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:51,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:51,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:50:51,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:50:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:51,004 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 5 states. [2019-12-27 16:50:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:51,087 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-27 16:50:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:50:51,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:50:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:51,115 INFO L225 Difference]: With dead ends: 18121 [2019-12-27 16:50:51,115 INFO L226 Difference]: Without dead ends: 18121 [2019-12-27 16:50:51,116 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 16:50:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-27 16:50:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-27 16:50:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 16:50:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-27 16:50:51,634 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-27 16:50:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:51,634 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-27 16:50:51,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:50:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-27 16:50:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:50:51,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:51,649 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 16:50:51,649 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 16:50:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-27 16:50:51,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:51,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056860007] [2019-12-27 16:50:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:51,684 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 16:50:51,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056860007] [2019-12-27 16:50:51,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:51,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:51,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717965180] [2019-12-27 16:50:51,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:51,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:51,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:50:51,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:51,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:51,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:51,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:51,698 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-27 16:50:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:51,804 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-27 16:50:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:50:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:51,835 INFO L225 Difference]: With dead ends: 23499 [2019-12-27 16:50:51,835 INFO L226 Difference]: Without dead ends: 23499 [2019-12-27 16:50:51,836 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 16:50:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-27 16:50:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-27 16:50:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 16:50:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-27 16:50:52,133 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-27 16:50:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:52,134 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-27 16:50:52,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-27 16:50:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:50:52,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:52,146 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 16:50:52,146 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 16:50:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-27 16:50:52,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:52,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503571869] [2019-12-27 16:50:52,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:52,238 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 16:50:52,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503571869] [2019-12-27 16:50:52,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:52,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:52,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640009471] [2019-12-27 16:50:52,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:52,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:52,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:50:52,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:52,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:50:52,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:50:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:52,250 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-27 16:50:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:52,618 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-27 16:50:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:50:52,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:50:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:52,647 INFO L225 Difference]: With dead ends: 21964 [2019-12-27 16:50:52,647 INFO L226 Difference]: Without dead ends: 21964 [2019-12-27 16:50:52,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 16:50:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-27 16:50:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-27 16:50:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-27 16:50:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-27 16:50:52,958 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-27 16:50:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:52,958 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-27 16:50:52,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:50:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-27 16:50:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:50:52,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:52,973 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 16:50:52,973 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 16:50:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:52,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-27 16:50:52,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:52,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282986063] [2019-12-27 16:50:52,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:53,059 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 16:50:53,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282986063] [2019-12-27 16:50:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:53,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583385270] [2019-12-27 16:50:53,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:53,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:53,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:50:53,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:53,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:53,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:50:53,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:50:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:53,075 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-27 16:50:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:53,555 INFO L93 Difference]: Finished difference Result 24066 states and 70567 transitions. [2019-12-27 16:50:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:50:53,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:50:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:53,604 INFO L225 Difference]: With dead ends: 24066 [2019-12-27 16:50:53,605 INFO L226 Difference]: Without dead ends: 24066 [2019-12-27 16:50:53,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 16:50:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24066 states. [2019-12-27 16:50:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24066 to 20500. [2019-12-27 16:50:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-12-27 16:50:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 60659 transitions. [2019-12-27 16:50:54,146 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 60659 transitions. Word has length 28 [2019-12-27 16:50:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:54,146 INFO L462 AbstractCegarLoop]: Abstraction has 20500 states and 60659 transitions. [2019-12-27 16:50:54,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:50:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 60659 transitions. [2019-12-27 16:50:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:50:54,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:54,168 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 16:50:54,168 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 16:50:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-27 16:50:54,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:54,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444409397] [2019-12-27 16:50:54,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:54,296 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 16:50:54,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444409397] [2019-12-27 16:50:54,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:54,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:50:54,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68909378] [2019-12-27 16:50:54,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:54,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:54,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:50:54,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:54,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:50:54,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:50:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:50:54,364 INFO L87 Difference]: Start difference. First operand 20500 states and 60659 transitions. Second operand 7 states. [2019-12-27 16:50:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:55,359 INFO L93 Difference]: Finished difference Result 27550 states and 80418 transitions. [2019-12-27 16:50:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:50:55,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 16:50:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:55,416 INFO L225 Difference]: With dead ends: 27550 [2019-12-27 16:50:55,416 INFO L226 Difference]: Without dead ends: 27550 [2019-12-27 16:50:55,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:50:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-12-27 16:50:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 21734. [2019-12-27 16:50:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-27 16:50:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64417 transitions. [2019-12-27 16:50:55,866 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64417 transitions. Word has length 33 [2019-12-27 16:50:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:55,866 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64417 transitions. [2019-12-27 16:50:55,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:50:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64417 transitions. [2019-12-27 16:50:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:50:55,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:55,887 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] [2019-12-27 16:50:55,887 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 16:50:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1108508854, now seen corresponding path program 1 times [2019-12-27 16:50:55,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:55,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273263781] [2019-12-27 16:50:55,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:56,006 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 16:50:56,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273263781] [2019-12-27 16:50:56,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:56,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:50:56,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457801823] [2019-12-27 16:50:56,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:56,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:56,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 16:50:56,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:56,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:56,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:50:56,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:56,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:50:56,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:50:56,058 INFO L87 Difference]: Start difference. First operand 21734 states and 64417 transitions. Second operand 7 states. [2019-12-27 16:50:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:56,958 INFO L93 Difference]: Finished difference Result 26719 states and 78128 transitions. [2019-12-27 16:50:56,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:50:56,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 16:50:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:56,997 INFO L225 Difference]: With dead ends: 26719 [2019-12-27 16:50:56,998 INFO L226 Difference]: Without dead ends: 26719 [2019-12-27 16:50:56,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:50:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2019-12-27 16:50:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 18663. [2019-12-27 16:50:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-27 16:50:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 55458 transitions. [2019-12-27 16:50:57,366 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 55458 transitions. Word has length 34 [2019-12-27 16:50:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:57,366 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 55458 transitions. [2019-12-27 16:50:57,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:50:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 55458 transitions. [2019-12-27 16:50:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:50:57,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:57,385 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 16:50:57,385 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 16:50:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-27 16:50:57,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:57,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326802183] [2019-12-27 16:50:57,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:57,462 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 16:50:57,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326802183] [2019-12-27 16:50:57,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:57,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:50:57,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546119672] [2019-12-27 16:50:57,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:57,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:57,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 16:50:57,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:57,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:57,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:57,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:57,651 INFO L87 Difference]: Start difference. First operand 18663 states and 55458 transitions. Second operand 3 states. [2019-12-27 16:50:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:57,713 INFO L93 Difference]: Finished difference Result 18662 states and 55456 transitions. [2019-12-27 16:50:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:57,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:50:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:57,738 INFO L225 Difference]: With dead ends: 18662 [2019-12-27 16:50:57,738 INFO L226 Difference]: Without dead ends: 18662 [2019-12-27 16:50:57,738 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 16:50:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-27 16:50:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 18662. [2019-12-27 16:50:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18662 states. [2019-12-27 16:50:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 55456 transitions. [2019-12-27 16:50:58,020 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 55456 transitions. Word has length 39 [2019-12-27 16:50:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:58,020 INFO L462 AbstractCegarLoop]: Abstraction has 18662 states and 55456 transitions. [2019-12-27 16:50:58,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 55456 transitions. [2019-12-27 16:50:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:50:58,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:58,039 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 16:50:58,040 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 16:50:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-27 16:50:58,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:58,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799265307] [2019-12-27 16:50:58,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:58,126 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 16:50:58,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799265307] [2019-12-27 16:50:58,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:58,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:58,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843794595] [2019-12-27 16:50:58,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:58,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:58,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 16:50:58,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:58,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:50:58,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:58,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:58,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:58,232 INFO L87 Difference]: Start difference. First operand 18662 states and 55456 transitions. Second operand 3 states. [2019-12-27 16:50:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:58,322 INFO L93 Difference]: Finished difference Result 18662 states and 55381 transitions. [2019-12-27 16:50:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:58,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 16:50:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:58,358 INFO L225 Difference]: With dead ends: 18662 [2019-12-27 16:50:58,358 INFO L226 Difference]: Without dead ends: 18662 [2019-12-27 16:50:58,359 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 16:50:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-27 16:50:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 16613. [2019-12-27 16:50:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16613 states. [2019-12-27 16:50:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16613 states to 16613 states and 49755 transitions. [2019-12-27 16:50:58,678 INFO L78 Accepts]: Start accepts. Automaton has 16613 states and 49755 transitions. Word has length 40 [2019-12-27 16:50:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:58,678 INFO L462 AbstractCegarLoop]: Abstraction has 16613 states and 49755 transitions. [2019-12-27 16:50:58,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16613 states and 49755 transitions. [2019-12-27 16:50:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:50:58,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:58,701 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 16:50:58,701 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 16:50:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 88308807, now seen corresponding path program 1 times [2019-12-27 16:50:58,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:58,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156386408] [2019-12-27 16:50:58,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:58,748 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 16:50:58,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156386408] [2019-12-27 16:50:58,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:58,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:50:58,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751300753] [2019-12-27 16:50:58,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:58,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:58,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 478 transitions. [2019-12-27 16:50:58,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:58,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:50:58,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:50:58,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:50:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:50:58,851 INFO L87 Difference]: Start difference. First operand 16613 states and 49755 transitions. Second operand 6 states. [2019-12-27 16:50:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:58,918 INFO L93 Difference]: Finished difference Result 15451 states and 47262 transitions. [2019-12-27 16:50:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:58,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:50:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:58,942 INFO L225 Difference]: With dead ends: 15451 [2019-12-27 16:50:58,942 INFO L226 Difference]: Without dead ends: 15451 [2019-12-27 16:50:58,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:50:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2019-12-27 16:50:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 15451. [2019-12-27 16:50:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15451 states. [2019-12-27 16:50:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15451 states to 15451 states and 47262 transitions. [2019-12-27 16:50:59,197 INFO L78 Accepts]: Start accepts. Automaton has 15451 states and 47262 transitions. Word has length 41 [2019-12-27 16:50:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:59,197 INFO L462 AbstractCegarLoop]: Abstraction has 15451 states and 47262 transitions. [2019-12-27 16:50:59,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:50:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15451 states and 47262 transitions. [2019-12-27 16:50:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:50:59,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:59,215 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 16:50:59,215 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 16:50:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1304450216, now seen corresponding path program 1 times [2019-12-27 16:50:59,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:59,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33159386] [2019-12-27 16:50:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:50:59,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33159386] [2019-12-27 16:50:59,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:59,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:50:59,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006712856] [2019-12-27 16:50:59,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:59,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:59,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 693 transitions. [2019-12-27 16:50:59,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:00,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 16:51:00,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:51:00,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:51:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:51:00,067 INFO L87 Difference]: Start difference. First operand 15451 states and 47262 transitions. Second operand 9 states. [2019-12-27 16:51:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:00,666 INFO L93 Difference]: Finished difference Result 43091 states and 130775 transitions. [2019-12-27 16:51:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:51:00,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 16:51:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:00,710 INFO L225 Difference]: With dead ends: 43091 [2019-12-27 16:51:00,711 INFO L226 Difference]: Without dead ends: 33563 [2019-12-27 16:51:00,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:51:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33563 states. [2019-12-27 16:51:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33563 to 18716. [2019-12-27 16:51:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18716 states. [2019-12-27 16:51:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18716 states to 18716 states and 57312 transitions. [2019-12-27 16:51:01,110 INFO L78 Accepts]: Start accepts. Automaton has 18716 states and 57312 transitions. Word has length 65 [2019-12-27 16:51:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:01,110 INFO L462 AbstractCegarLoop]: Abstraction has 18716 states and 57312 transitions. [2019-12-27 16:51:01,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:51:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18716 states and 57312 transitions. [2019-12-27 16:51:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:51:01,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:01,130 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 16:51:01,130 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 16:51:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 365557572, now seen corresponding path program 2 times [2019-12-27 16:51:01,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:01,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216392516] [2019-12-27 16:51:01,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:51:01,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216392516] [2019-12-27 16:51:01,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:01,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:51:01,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760719935] [2019-12-27 16:51:01,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:01,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:01,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 360 states and 740 transitions. [2019-12-27 16:51:01,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:01,710 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 16:51:01,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 16:51:01,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:51:01,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:51:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:51:01,778 INFO L87 Difference]: Start difference. First operand 18716 states and 57312 transitions. Second operand 8 states. [2019-12-27 16:51:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:03,803 INFO L93 Difference]: Finished difference Result 58449 states and 176215 transitions. [2019-12-27 16:51:03,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:51:03,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 16:51:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:03,870 INFO L225 Difference]: With dead ends: 58449 [2019-12-27 16:51:03,870 INFO L226 Difference]: Without dead ends: 43940 [2019-12-27 16:51:03,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:51:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43940 states. [2019-12-27 16:51:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43940 to 22240. [2019-12-27 16:51:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22240 states. [2019-12-27 16:51:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22240 states to 22240 states and 67678 transitions. [2019-12-27 16:51:04,384 INFO L78 Accepts]: Start accepts. Automaton has 22240 states and 67678 transitions. Word has length 65 [2019-12-27 16:51:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:04,385 INFO L462 AbstractCegarLoop]: Abstraction has 22240 states and 67678 transitions. [2019-12-27 16:51:04,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:51:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22240 states and 67678 transitions. [2019-12-27 16:51:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:51:04,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:04,405 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 16:51:04,405 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 16:51:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:04,406 INFO L82 PathProgramCache]: Analyzing trace with hash -145794860, now seen corresponding path program 3 times [2019-12-27 16:51:04,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:04,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593407841] [2019-12-27 16:51:04,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:04,498 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 16:51:04,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593407841] [2019-12-27 16:51:04,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:04,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:51:04,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115453994] [2019-12-27 16:51:04,499 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:04,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:04,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 16:51:04,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:04,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:51:04,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:51:04,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:51:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:51:04,980 INFO L87 Difference]: Start difference. First operand 22240 states and 67678 transitions. Second operand 9 states. [2019-12-27 16:51:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:06,378 INFO L93 Difference]: Finished difference Result 67106 states and 202096 transitions. [2019-12-27 16:51:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 16:51:06,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 16:51:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:06,468 INFO L225 Difference]: With dead ends: 67106 [2019-12-27 16:51:06,469 INFO L226 Difference]: Without dead ends: 64395 [2019-12-27 16:51:06,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:51:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64395 states. [2019-12-27 16:51:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64395 to 22336. [2019-12-27 16:51:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22336 states. [2019-12-27 16:51:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22336 states to 22336 states and 68022 transitions. [2019-12-27 16:51:07,150 INFO L78 Accepts]: Start accepts. Automaton has 22336 states and 68022 transitions. Word has length 65 [2019-12-27 16:51:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:07,150 INFO L462 AbstractCegarLoop]: Abstraction has 22336 states and 68022 transitions. [2019-12-27 16:51:07,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:51:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 22336 states and 68022 transitions. [2019-12-27 16:51:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:51:07,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:07,175 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 16:51:07,175 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 16:51:07,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:07,175 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-27 16:51:07,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:07,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934953663] [2019-12-27 16:51:07,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:07,239 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 16:51:07,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934953663] [2019-12-27 16:51:07,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:07,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:51:07,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [268037278] [2019-12-27 16:51:07,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:07,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:07,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 699 transitions. [2019-12-27 16:51:07,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:07,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:51:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:51:07,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:51:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:51:07,589 INFO L87 Difference]: Start difference. First operand 22336 states and 68022 transitions. Second operand 3 states. [2019-12-27 16:51:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:07,704 INFO L93 Difference]: Finished difference Result 25603 states and 78129 transitions. [2019-12-27 16:51:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:51:07,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:51:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:07,738 INFO L225 Difference]: With dead ends: 25603 [2019-12-27 16:51:07,738 INFO L226 Difference]: Without dead ends: 25603 [2019-12-27 16:51:07,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 16:51:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25603 states. [2019-12-27 16:51:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25603 to 21055. [2019-12-27 16:51:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21055 states. [2019-12-27 16:51:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21055 states to 21055 states and 64905 transitions. [2019-12-27 16:51:08,269 INFO L78 Accepts]: Start accepts. Automaton has 21055 states and 64905 transitions. Word has length 65 [2019-12-27 16:51:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:08,269 INFO L462 AbstractCegarLoop]: Abstraction has 21055 states and 64905 transitions. [2019-12-27 16:51:08,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:51:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21055 states and 64905 transitions. [2019-12-27 16:51:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:51:08,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:08,292 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 16:51:08,292 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 16:51:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 633009557, now seen corresponding path program 1 times [2019-12-27 16:51:08,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:08,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213167458] [2019-12-27 16:51:08,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:51:08,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213167458] [2019-12-27 16:51:08,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:08,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:51:08,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258274286] [2019-12-27 16:51:08,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:08,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:08,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 512 transitions. [2019-12-27 16:51:08,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:08,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:51:08,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:51:08,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:08,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:51:08,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:51:08,665 INFO L87 Difference]: Start difference. First operand 21055 states and 64905 transitions. Second operand 7 states. [2019-12-27 16:51:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:09,130 INFO L93 Difference]: Finished difference Result 43255 states and 132201 transitions. [2019-12-27 16:51:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:51:09,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 16:51:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:09,214 INFO L225 Difference]: With dead ends: 43255 [2019-12-27 16:51:09,214 INFO L226 Difference]: Without dead ends: 40099 [2019-12-27 16:51:09,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:51:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40099 states. [2019-12-27 16:51:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40099 to 21181. [2019-12-27 16:51:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21181 states. [2019-12-27 16:51:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21181 states to 21181 states and 65388 transitions. [2019-12-27 16:51:09,775 INFO L78 Accepts]: Start accepts. Automaton has 21181 states and 65388 transitions. Word has length 66 [2019-12-27 16:51:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:09,775 INFO L462 AbstractCegarLoop]: Abstraction has 21181 states and 65388 transitions. [2019-12-27 16:51:09,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:51:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21181 states and 65388 transitions. [2019-12-27 16:51:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:51:09,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:09,795 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 16:51:09,795 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 16:51:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2128783339, now seen corresponding path program 2 times [2019-12-27 16:51:09,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:09,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99539144] [2019-12-27 16:51:09,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:09,855 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 16:51:09,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99539144] [2019-12-27 16:51:09,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:09,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:51:09,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13383179] [2019-12-27 16:51:09,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:09,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:10,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 401 transitions. [2019-12-27 16:51:10,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:10,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:51:10,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:51:10,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:51:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:51:10,282 INFO L87 Difference]: Start difference. First operand 21181 states and 65388 transitions. Second operand 4 states. [2019-12-27 16:51:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:10,390 INFO L93 Difference]: Finished difference Result 20983 states and 64600 transitions. [2019-12-27 16:51:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:51:10,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 16:51:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:10,418 INFO L225 Difference]: With dead ends: 20983 [2019-12-27 16:51:10,418 INFO L226 Difference]: Without dead ends: 20983 [2019-12-27 16:51:10,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:51:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20983 states. [2019-12-27 16:51:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20983 to 19228. [2019-12-27 16:51:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19228 states. [2019-12-27 16:51:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19228 states to 19228 states and 59308 transitions. [2019-12-27 16:51:10,729 INFO L78 Accepts]: Start accepts. Automaton has 19228 states and 59308 transitions. Word has length 66 [2019-12-27 16:51:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:10,730 INFO L462 AbstractCegarLoop]: Abstraction has 19228 states and 59308 transitions. [2019-12-27 16:51:10,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:51:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19228 states and 59308 transitions. [2019-12-27 16:51:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:51:10,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:10,748 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 16:51:10,748 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 16:51:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-27 16:51:10,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:10,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102131005] [2019-12-27 16:51:10,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:10,813 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 16:51:10,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102131005] [2019-12-27 16:51:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:51:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347348211] [2019-12-27 16:51:10,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:10,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:11,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 359 states and 704 transitions. [2019-12-27 16:51:11,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:11,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:51:11,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:51:11,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:11,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:51:11,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:51:11,255 INFO L87 Difference]: Start difference. First operand 19228 states and 59308 transitions. Second operand 6 states. [2019-12-27 16:51:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:11,583 INFO L93 Difference]: Finished difference Result 21615 states and 64341 transitions. [2019-12-27 16:51:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:51:11,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 16:51:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:11,611 INFO L225 Difference]: With dead ends: 21615 [2019-12-27 16:51:11,611 INFO L226 Difference]: Without dead ends: 21615 [2019-12-27 16:51:11,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:51:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21615 states. [2019-12-27 16:51:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21615 to 14321. [2019-12-27 16:51:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-27 16:51:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 43147 transitions. [2019-12-27 16:51:11,874 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 43147 transitions. Word has length 66 [2019-12-27 16:51:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:11,875 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 43147 transitions. [2019-12-27 16:51:11,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:51:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 43147 transitions. [2019-12-27 16:51:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:51:11,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:11,889 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 16:51:11,889 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 16:51:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-27 16:51:11,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:11,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14701061] [2019-12-27 16:51:11,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:12,058 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 16:51:12,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14701061] [2019-12-27 16:51:12,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:12,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:51:12,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975280954] [2019-12-27 16:51:12,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:12,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:12,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 333 states and 685 transitions. [2019-12-27 16:51:12,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:12,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:51:12,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:51:12,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:51:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:51:12,597 INFO L87 Difference]: Start difference. First operand 14321 states and 43147 transitions. Second operand 13 states. [2019-12-27 16:51:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:13,785 INFO L93 Difference]: Finished difference Result 32717 states and 97111 transitions. [2019-12-27 16:51:13,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 16:51:13,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 16:51:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:13,829 INFO L225 Difference]: With dead ends: 32717 [2019-12-27 16:51:13,829 INFO L226 Difference]: Without dead ends: 24944 [2019-12-27 16:51:13,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:51:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24944 states. [2019-12-27 16:51:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24944 to 13865. [2019-12-27 16:51:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13865 states. [2019-12-27 16:51:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13865 states to 13865 states and 41455 transitions. [2019-12-27 16:51:14,129 INFO L78 Accepts]: Start accepts. Automaton has 13865 states and 41455 transitions. Word has length 67 [2019-12-27 16:51:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:14,129 INFO L462 AbstractCegarLoop]: Abstraction has 13865 states and 41455 transitions. [2019-12-27 16:51:14,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:51:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13865 states and 41455 transitions. [2019-12-27 16:51:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:51:14,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:14,144 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 16:51:14,144 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 16:51:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-27 16:51:14,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645108500] [2019-12-27 16:51:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:51:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:51:14,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:51:14,272 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:51:14,277 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 16:51:14,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd0~0_In241329229 ~a$r_buff1_thd0~0_Out241329229) (= ~a$r_buff1_thd1~0_Out241329229 ~a$r_buff0_thd1~0_In241329229) (= ~a$r_buff1_thd3~0_Out241329229 ~a$r_buff0_thd3~0_In241329229) (= ~a$r_buff0_thd1~0_Out241329229 1) (= ~x~0_In241329229 ~__unbuffered_p0_EAX~0_Out241329229) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In241329229 0)) (= ~a$r_buff1_thd2~0_Out241329229 ~a$r_buff0_thd2~0_In241329229)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In241329229, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In241329229, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In241329229, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In241329229, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In241329229, ~x~0=~x~0_In241329229} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out241329229, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out241329229, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out241329229, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out241329229, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In241329229, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out241329229, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In241329229, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In241329229, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out241329229, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In241329229, ~x~0=~x~0_In241329229} 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 16:51:14,280 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 16:51:14,281 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 16:51:14,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-959256759 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-959256759 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-959256759| ~a$w_buff1~0_In-959256759)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-959256759| ~a~0_In-959256759) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-959256759, ~a$w_buff1~0=~a$w_buff1~0_In-959256759, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-959256759, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-959256759} OutVars{~a~0=~a~0_In-959256759, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-959256759|, ~a$w_buff1~0=~a$w_buff1~0_In-959256759, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-959256759, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-959256759} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 16:51:14,284 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 16:51:14,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1992195482 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1992195482 256) 0))) (or (and (= ~a$w_buff0_used~0_In1992195482 |P1Thread1of1ForFork2_#t~ite11_Out1992195482|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1992195482|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1992195482, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1992195482} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1992195482, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1992195482, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1992195482|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:51:14,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1305290482 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1305290482 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1305290482 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1305290482 256)))) (or (and (= ~a$w_buff1_used~0_In1305290482 |P1Thread1of1ForFork2_#t~ite12_Out1305290482|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1305290482|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1305290482, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1305290482, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1305290482, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1305290482} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1305290482, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1305290482, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1305290482, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1305290482|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1305290482} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:51:14,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-385584802 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-385584802 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-385584802|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-385584802 |P1Thread1of1ForFork2_#t~ite13_Out-385584802|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-385584802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-385584802} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-385584802, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-385584802, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-385584802|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:51:14,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In-134060762 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-134060762 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-134060762 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-134060762 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-134060762| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-134060762| ~a$r_buff1_thd2~0_In-134060762)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-134060762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-134060762, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-134060762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-134060762} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-134060762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-134060762, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-134060762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-134060762, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-134060762|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:51:14,287 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 16:51:14,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-104810885 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-104810885 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-104810885 |P0Thread1of1ForFork1_#t~ite5_Out-104810885|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-104810885| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-104810885, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-104810885} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-104810885|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-104810885, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-104810885} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:51:14,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In649424504 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In649424504 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In649424504 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In649424504 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out649424504| ~a$w_buff1_used~0_In649424504) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out649424504| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In649424504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In649424504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In649424504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In649424504} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out649424504|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In649424504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In649424504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In649424504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In649424504} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:51:14,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1849604618 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1849604618 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1849604618)) (and (= ~a$r_buff0_thd1~0_In-1849604618 ~a$r_buff0_thd1~0_Out-1849604618) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849604618, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1849604618} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1849604618|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849604618, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1849604618} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:51:14,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1368114222 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1368114222 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1368114222 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1368114222 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1368114222| ~a$r_buff1_thd1~0_In1368114222) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1368114222|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1368114222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1368114222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1368114222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1368114222} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1368114222|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1368114222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1368114222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1368114222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1368114222} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:51:14,290 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 16:51:14,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2124516081 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out2124516081| ~a$w_buff1_used~0_In2124516081) (= |P2Thread1of1ForFork0_#t~ite30_Out2124516081| |P2Thread1of1ForFork0_#t~ite29_Out2124516081|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2124516081 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2124516081 256))) (= (mod ~a$w_buff0_used~0_In2124516081 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In2124516081 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite30_Out2124516081| ~a$w_buff1_used~0_In2124516081) (= |P2Thread1of1ForFork0_#t~ite29_In2124516081| |P2Thread1of1ForFork0_#t~ite29_Out2124516081|) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2124516081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124516081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2124516081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124516081, ~weak$$choice2~0=~weak$$choice2~0_In2124516081, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2124516081|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2124516081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124516081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2124516081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124516081, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2124516081|, ~weak$$choice2~0=~weak$$choice2~0_In2124516081, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2124516081|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:51:14,302 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 16:51:14,306 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 16:51:14,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1990313341 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1990313341 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1990313341 |P2Thread1of1ForFork0_#t~ite38_Out1990313341|)) (and (or .cse0 .cse1) (= ~a~0_In1990313341 |P2Thread1of1ForFork0_#t~ite38_Out1990313341|)))) InVars {~a~0=~a~0_In1990313341, ~a$w_buff1~0=~a$w_buff1~0_In1990313341, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1990313341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1990313341} OutVars{~a~0=~a~0_In1990313341, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1990313341|, ~a$w_buff1~0=~a$w_buff1~0_In1990313341, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1990313341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1990313341} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:51:14,309 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 16:51:14,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In268458287 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In268458287 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out268458287| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out268458287| ~a$w_buff0_used~0_In268458287)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In268458287, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In268458287} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out268458287|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In268458287, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In268458287} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:51:14,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In225768150 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In225768150 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In225768150 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In225768150 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out225768150|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In225768150 |P2Thread1of1ForFork0_#t~ite41_Out225768150|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In225768150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In225768150, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In225768150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In225768150} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In225768150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In225768150, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In225768150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In225768150, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out225768150|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:51:14,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In506108342 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In506108342 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In506108342 |P2Thread1of1ForFork0_#t~ite42_Out506108342|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out506108342|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In506108342, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In506108342} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In506108342, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In506108342, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out506108342|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:51:14,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In473927896 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In473927896 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In473927896 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In473927896 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In473927896 |P2Thread1of1ForFork0_#t~ite43_Out473927896|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out473927896|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In473927896, ~a$w_buff0_used~0=~a$w_buff0_used~0_In473927896, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In473927896, ~a$w_buff1_used~0=~a$w_buff1_used~0_In473927896} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out473927896|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In473927896, ~a$w_buff0_used~0=~a$w_buff0_used~0_In473927896, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In473927896, ~a$w_buff1_used~0=~a$w_buff1_used~0_In473927896} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:51:14,316 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 16:51:14,316 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 16:51:14,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In351577013 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In351577013 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out351577013| |ULTIMATE.start_main_#t~ite47_Out351577013|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out351577013| ~a$w_buff1~0_In351577013) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~a~0_In351577013 |ULTIMATE.start_main_#t~ite47_Out351577013|)))) InVars {~a~0=~a~0_In351577013, ~a$w_buff1~0=~a$w_buff1~0_In351577013, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In351577013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In351577013} OutVars{~a~0=~a~0_In351577013, ~a$w_buff1~0=~a$w_buff1~0_In351577013, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out351577013|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In351577013, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out351577013|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In351577013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:51:14,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2063436950 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-2063436950 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-2063436950| ~a$w_buff0_used~0_In-2063436950) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-2063436950| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2063436950, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2063436950} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2063436950, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2063436950|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2063436950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:51:14,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1349138488 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1349138488 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1349138488 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1349138488 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1349138488|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1349138488 |ULTIMATE.start_main_#t~ite50_Out-1349138488|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1349138488, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1349138488, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1349138488, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1349138488} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1349138488|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1349138488, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1349138488, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1349138488, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1349138488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:51:14,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1259822467 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1259822467 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1259822467|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1259822467 |ULTIMATE.start_main_#t~ite51_Out-1259822467|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1259822467, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1259822467} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1259822467|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1259822467, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1259822467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:51:14,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-289914684 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-289914684 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-289914684 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-289914684 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-289914684| ~a$r_buff1_thd0~0_In-289914684) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-289914684| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-289914684, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-289914684, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-289914684, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-289914684} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-289914684|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-289914684, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-289914684, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-289914684, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-289914684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:51:14,328 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 16:51:14,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:51:14 BasicIcfg [2019-12-27 16:51:14,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:51:14,434 INFO L168 Benchmark]: Toolchain (without parser) took 98541.42 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,434 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:51:14,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.12 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,440 INFO L168 Benchmark]: Boogie Preprocessor took 60.45 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,440 INFO L168 Benchmark]: RCFGBuilder took 1062.73 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 100.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,444 INFO L168 Benchmark]: TraceAbstraction took 96513.96 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 16:51:14,449 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.17 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.12 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 156.5 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.45 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1062.73 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 100.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96513.96 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&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: 96.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5652 SDtfs, 6178 SDslu, 16111 SDs, 0 SdLazy, 6910 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 100 SyntacticMatches, 54 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.8s 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: 34.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 223091 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 153453 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...