/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:14:00,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:14:00,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:14:00,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:14:00,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:14:00,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:14:00,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:14:00,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:14:00,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:14:00,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:14:00,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:14:00,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:14:00,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:14:00,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:14:00,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:14:00,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:14:00,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:14:00,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:14:00,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:14:00,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:14:00,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:14:00,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:14:00,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:14:00,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:14:00,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:14:00,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:14:00,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:14:00,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:14:00,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:14:00,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:14:00,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:14:00,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:14:00,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:14:00,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:14:00,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:14:00,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:14:00,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:14:00,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:14:00,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:14:00,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:14:00,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:14:00,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:14:00,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:14:00,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:14:00,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:14:00,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:14:00,646 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:14:00,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:14:00,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:14:00,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:14:00,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:14:00,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:14:00,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:14:00,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:14:00,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:14:00,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:14:00,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:14:00,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:14:00,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:14:00,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:14:00,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:14:00,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:14:00,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:14:00,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:14:00,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:14:00,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:14:00,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:14:00,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:14:00,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:14:00,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:14:00,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:14:00,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:14:00,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:14:00,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:14:00,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:14:00,964 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:14:00,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i [2019-12-18 16:14:01,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824f4fec7/7af0d28d1ccb4c1d9e0fc8bdbb85535f/FLAGbbeccc4aa [2019-12-18 16:14:01,646 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:14:01,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i [2019-12-18 16:14:01,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824f4fec7/7af0d28d1ccb4c1d9e0fc8bdbb85535f/FLAGbbeccc4aa [2019-12-18 16:14:01,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824f4fec7/7af0d28d1ccb4c1d9e0fc8bdbb85535f [2019-12-18 16:14:01,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:14:01,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:14:01,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:14:01,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:14:01,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:14:01,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:14:01" (1/1) ... [2019-12-18 16:14:01,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:01, skipping insertion in model container [2019-12-18 16:14:01,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:14:01" (1/1) ... [2019-12-18 16:14:01,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:14:01,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:14:02,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:14:02,613 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:14:02,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:14:02,758 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:14:02,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02 WrapperNode [2019-12-18 16:14:02,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:14:02,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:14:02,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:14:02,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:14:02,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:14:02,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:14:02,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:14:02,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:14:02,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (1/1) ... [2019-12-18 16:14:02,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:14:02,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:14:02,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:14:02,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:14:02,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (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-18 16:14:02,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:14:02,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:14:02,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:14:02,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:14:02,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:14:02,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:14:02,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:14:02,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:14:02,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:14:02,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:14:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:14:02,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:14:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:14:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:14:02,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:14:02,972 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:14:03,813 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:14:03,813 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:14:03,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:14:03 BoogieIcfgContainer [2019-12-18 16:14:03,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:14:03,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:14:03,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:14:03,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:14:03,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:14:01" (1/3) ... [2019-12-18 16:14:03,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa056c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:14:03, skipping insertion in model container [2019-12-18 16:14:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:14:02" (2/3) ... [2019-12-18 16:14:03,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa056c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:14:03, skipping insertion in model container [2019-12-18 16:14:03,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:14:03" (3/3) ... [2019-12-18 16:14:03,838 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_tso.opt.i [2019-12-18 16:14:03,845 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:14:03,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:14:03,854 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:14:03,855 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:14:03,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,925 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,925 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,925 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,926 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,926 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,932 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,933 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,934 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,935 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,939 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,941 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,941 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,941 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,941 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,941 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,968 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,976 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,977 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,978 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,980 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:03,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:14:04,001 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:14:04,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:14:04,023 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:14:04,023 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:14:04,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:14:04,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:14:04,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:14:04,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:14:04,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:14:04,044 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-18 16:14:04,046 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 16:14:04,180 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 16:14:04,181 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:14:04,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 16:14:04,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 16:14:04,326 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 16:14:04,326 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:14:04,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 16:14:04,375 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 16:14:04,376 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:14:10,365 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-18 16:14:10,535 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 16:14:10,660 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 16:14:11,100 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 16:14:11,249 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 16:14:11,304 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-18 16:14:11,304 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-18 16:14:11,308 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-18 16:14:20,941 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-18 16:14:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-18 16:14:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 16:14:20,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:14:20,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:14:20,952 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:14:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:14:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-18 16:14:20,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:14:20,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034625642] [2019-12-18 16:14:20,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:14:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:14:21,257 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-18 16:14:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034625642] [2019-12-18 16:14:21,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:14:21,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:14:21,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546016728] [2019-12-18 16:14:21,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:14:21,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:14:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:14:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:14:21,284 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-18 16:14:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:14:23,831 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-18 16:14:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:14:23,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 16:14:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:14:24,454 INFO L225 Difference]: With dead ends: 85406 [2019-12-18 16:14:24,454 INFO L226 Difference]: Without dead ends: 79558 [2019-12-18 16:14:24,456 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-18 16:14:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-18 16:14:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-18 16:14:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-18 16:14:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-18 16:14:33,786 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-18 16:14:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:14:33,787 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-18 16:14:33,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:14:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-18 16:14:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:14:33,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:14:33,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:14:33,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:14:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:14:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-18 16:14:33,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:14:33,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167874201] [2019-12-18 16:14:33,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:14:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:14:33,984 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-18 16:14:33,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167874201] [2019-12-18 16:14:33,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:14:33,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:14:33,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531909818] [2019-12-18 16:14:33,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:14:33,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:14:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:14:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:14:33,988 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-18 16:14:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:14:35,896 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-18 16:14:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:14:35,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:14:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:14:36,397 INFO L225 Difference]: With dead ends: 126790 [2019-12-18 16:14:36,397 INFO L226 Difference]: Without dead ends: 126726 [2019-12-18 16:14:36,398 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-18 16:14:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-18 16:14:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-18 16:14:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-18 16:14:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-18 16:14:46,170 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-18 16:14:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:14:46,171 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-18 16:14:46,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:14:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-18 16:14:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:14:46,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:14:46,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:14:46,180 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:14:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:14:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-18 16:14:46,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:14:46,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901715950] [2019-12-18 16:14:46,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:14:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:14:46,266 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-18 16:14:46,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901715950] [2019-12-18 16:14:46,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:14:46,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:14:46,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222546373] [2019-12-18 16:14:46,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:14:46,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:14:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:14:46,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:14:46,274 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-18 16:14:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:14:53,446 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-18 16:14:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:14:53,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 16:14:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:14:54,157 INFO L225 Difference]: With dead ends: 159910 [2019-12-18 16:14:54,158 INFO L226 Difference]: Without dead ends: 159850 [2019-12-18 16:14:54,158 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-18 16:14:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-18 16:14:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-18 16:14:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-18 16:14:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-18 16:14:59,735 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-18 16:14:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:14:59,735 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-18 16:14:59,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:14:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-18 16:14:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 16:14:59,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:14:59,755 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] [2019-12-18 16:14:59,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:14:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:14:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-18 16:14:59,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:14:59,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159698882] [2019-12-18 16:14:59,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:14:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:14:59,819 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-18 16:14:59,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159698882] [2019-12-18 16:14:59,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:14:59,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:14:59,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888454531] [2019-12-18 16:14:59,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:14:59,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:14:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:14:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:14:59,822 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-18 16:15:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:15:05,853 INFO L93 Difference]: Finished difference Result 141310 states and 627848 transitions. [2019-12-18 16:15:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:15:05,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 16:15:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:15:06,669 INFO L225 Difference]: With dead ends: 141310 [2019-12-18 16:15:06,670 INFO L226 Difference]: Without dead ends: 141310 [2019-12-18 16:15:06,670 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-18 16:15:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141310 states. [2019-12-18 16:15:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141310 to 141310. [2019-12-18 16:15:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141310 states. [2019-12-18 16:15:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141310 states to 141310 states and 627848 transitions. [2019-12-18 16:15:12,073 INFO L78 Accepts]: Start accepts. Automaton has 141310 states and 627848 transitions. Word has length 20 [2019-12-18 16:15:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:15:12,074 INFO L462 AbstractCegarLoop]: Abstraction has 141310 states and 627848 transitions. [2019-12-18 16:15:12,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:15:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 141310 states and 627848 transitions. [2019-12-18 16:15:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 16:15:12,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:15:12,094 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] [2019-12-18 16:15:12,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:15:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:15:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1444973627, now seen corresponding path program 1 times [2019-12-18 16:15:12,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:15:12,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662942384] [2019-12-18 16:15:12,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:15:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:15:12,154 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-18 16:15:12,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662942384] [2019-12-18 16:15:12,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:15:12,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:15:12,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707113819] [2019-12-18 16:15:12,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:15:12,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:15:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:15:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:15:12,156 INFO L87 Difference]: Start difference. First operand 141310 states and 627848 transitions. Second operand 3 states. [2019-12-18 16:15:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:15:14,082 INFO L93 Difference]: Finished difference Result 133278 states and 591216 transitions. [2019-12-18 16:15:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:15:14,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 16:15:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:15:14,529 INFO L225 Difference]: With dead ends: 133278 [2019-12-18 16:15:14,530 INFO L226 Difference]: Without dead ends: 133278 [2019-12-18 16:15:14,530 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-18 16:15:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133278 states. [2019-12-18 16:15:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133278 to 133278. [2019-12-18 16:15:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133278 states. [2019-12-18 16:15:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133278 states to 133278 states and 591216 transitions. [2019-12-18 16:15:25,182 INFO L78 Accepts]: Start accepts. Automaton has 133278 states and 591216 transitions. Word has length 21 [2019-12-18 16:15:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:15:25,183 INFO L462 AbstractCegarLoop]: Abstraction has 133278 states and 591216 transitions. [2019-12-18 16:15:25,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:15:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 133278 states and 591216 transitions. [2019-12-18 16:15:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:15:25,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:15:25,222 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] [2019-12-18 16:15:25,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:15:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:15:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -923267308, now seen corresponding path program 1 times [2019-12-18 16:15:25,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:15:25,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518428158] [2019-12-18 16:15:25,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:15:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:15:25,319 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-18 16:15:25,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518428158] [2019-12-18 16:15:25,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:15:25,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:15:25,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263823984] [2019-12-18 16:15:25,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:15:25,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:15:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:15:25,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:15:25,322 INFO L87 Difference]: Start difference. First operand 133278 states and 591216 transitions. Second operand 5 states. [2019-12-18 16:15:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:15:31,993 INFO L93 Difference]: Finished difference Result 159602 states and 699380 transitions. [2019-12-18 16:15:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:15:31,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 16:15:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:15:32,530 INFO L225 Difference]: With dead ends: 159602 [2019-12-18 16:15:32,530 INFO L226 Difference]: Without dead ends: 159490 [2019-12-18 16:15:32,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:15:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159490 states. [2019-12-18 16:15:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159490 to 132770. [2019-12-18 16:15:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132770 states. [2019-12-18 16:15:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132770 states to 132770 states and 589072 transitions. [2019-12-18 16:15:38,191 INFO L78 Accepts]: Start accepts. Automaton has 132770 states and 589072 transitions. Word has length 24 [2019-12-18 16:15:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:15:38,191 INFO L462 AbstractCegarLoop]: Abstraction has 132770 states and 589072 transitions. [2019-12-18 16:15:38,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:15:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 132770 states and 589072 transitions. [2019-12-18 16:15:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 16:15:38,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:15:38,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:15:38,375 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:15:38,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:15:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1614738075, now seen corresponding path program 1 times [2019-12-18 16:15:38,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:15:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928422179] [2019-12-18 16:15:38,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:15:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:15:38,458 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-18 16:15:38,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928422179] [2019-12-18 16:15:38,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:15:38,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:15:38,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433960842] [2019-12-18 16:15:38,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:15:38,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:15:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:15:38,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:15:38,461 INFO L87 Difference]: Start difference. First operand 132770 states and 589072 transitions. Second operand 4 states. [2019-12-18 16:15:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:15:39,043 INFO L93 Difference]: Finished difference Result 111727 states and 456620 transitions. [2019-12-18 16:15:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:15:39,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 16:15:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:15:39,341 INFO L225 Difference]: With dead ends: 111727 [2019-12-18 16:15:39,341 INFO L226 Difference]: Without dead ends: 103187 [2019-12-18 16:15:39,341 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-18 16:15:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103187 states. [2019-12-18 16:15:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103187 to 103187. [2019-12-18 16:15:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103187 states. [2019-12-18 16:15:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103187 states to 103187 states and 424643 transitions. [2019-12-18 16:15:47,463 INFO L78 Accepts]: Start accepts. Automaton has 103187 states and 424643 transitions. Word has length 35 [2019-12-18 16:15:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:15:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 103187 states and 424643 transitions. [2019-12-18 16:15:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:15:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 103187 states and 424643 transitions. [2019-12-18 16:15:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 16:15:47,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:15:47,600 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] [2019-12-18 16:15:47,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:15:47,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:15:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1422023017, now seen corresponding path program 1 times [2019-12-18 16:15:47,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:15:47,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156129266] [2019-12-18 16:15:47,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:15:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:15:47,682 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-18 16:15:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156129266] [2019-12-18 16:15:47,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:15:47,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:15:47,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510694882] [2019-12-18 16:15:47,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:15:47,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:15:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:15:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:15:47,685 INFO L87 Difference]: Start difference. First operand 103187 states and 424643 transitions. Second operand 4 states. [2019-12-18 16:15:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:15:49,739 INFO L93 Difference]: Finished difference Result 197377 states and 799296 transitions. [2019-12-18 16:15:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:15:49,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-18 16:15:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:15:50,331 INFO L225 Difference]: With dead ends: 197377 [2019-12-18 16:15:50,331 INFO L226 Difference]: Without dead ends: 197377 [2019-12-18 16:15:50,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:15:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197377 states. [2019-12-18 16:15:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197377 to 137132. [2019-12-18 16:15:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137132 states. [2019-12-18 16:16:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137132 states to 137132 states and 564886 transitions. [2019-12-18 16:16:00,866 INFO L78 Accepts]: Start accepts. Automaton has 137132 states and 564886 transitions. Word has length 36 [2019-12-18 16:16:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:00,867 INFO L462 AbstractCegarLoop]: Abstraction has 137132 states and 564886 transitions. [2019-12-18 16:16:00,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:16:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 137132 states and 564886 transitions. [2019-12-18 16:16:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 16:16:01,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:01,040 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] [2019-12-18 16:16:01,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1317274661, now seen corresponding path program 2 times [2019-12-18 16:16:01,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:01,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435652924] [2019-12-18 16:16:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:01,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-18 16:16:01,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435652924] [2019-12-18 16:16:01,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:01,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:16:01,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387945145] [2019-12-18 16:16:01,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:16:01,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:16:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:16:01,128 INFO L87 Difference]: Start difference. First operand 137132 states and 564886 transitions. Second operand 5 states. [2019-12-18 16:16:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:01,456 INFO L93 Difference]: Finished difference Result 66967 states and 237379 transitions. [2019-12-18 16:16:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:16:01,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 16:16:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:01,570 INFO L225 Difference]: With dead ends: 66967 [2019-12-18 16:16:01,570 INFO L226 Difference]: Without dead ends: 57088 [2019-12-18 16:16:01,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:16:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57088 states. [2019-12-18 16:16:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57088 to 57088. [2019-12-18 16:16:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57088 states. [2019-12-18 16:16:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57088 states to 57088 states and 199901 transitions. [2019-12-18 16:16:03,714 INFO L78 Accepts]: Start accepts. Automaton has 57088 states and 199901 transitions. Word has length 36 [2019-12-18 16:16:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:03,715 INFO L462 AbstractCegarLoop]: Abstraction has 57088 states and 199901 transitions. [2019-12-18 16:16:03,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:16:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 57088 states and 199901 transitions. [2019-12-18 16:16:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 16:16:03,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:03,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:16:03,766 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 32030356, now seen corresponding path program 1 times [2019-12-18 16:16:03,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:03,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373647995] [2019-12-18 16:16:03,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:03,872 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-18 16:16:03,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373647995] [2019-12-18 16:16:03,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:03,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:16:03,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300619943] [2019-12-18 16:16:03,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:16:03,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:16:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:16:03,874 INFO L87 Difference]: Start difference. First operand 57088 states and 199901 transitions. Second operand 6 states. [2019-12-18 16:16:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:04,052 INFO L93 Difference]: Finished difference Result 18326 states and 61810 transitions. [2019-12-18 16:16:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:16:04,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 16:16:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:04,088 INFO L225 Difference]: With dead ends: 18326 [2019-12-18 16:16:04,088 INFO L226 Difference]: Without dead ends: 14761 [2019-12-18 16:16:04,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:16:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14761 states. [2019-12-18 16:16:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14761 to 14509. [2019-12-18 16:16:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14509 states. [2019-12-18 16:16:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14509 states to 14509 states and 48816 transitions. [2019-12-18 16:16:04,306 INFO L78 Accepts]: Start accepts. Automaton has 14509 states and 48816 transitions. Word has length 37 [2019-12-18 16:16:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:04,306 INFO L462 AbstractCegarLoop]: Abstraction has 14509 states and 48816 transitions. [2019-12-18 16:16:04,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:16:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 14509 states and 48816 transitions. [2019-12-18 16:16:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 16:16:04,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:04,325 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] [2019-12-18 16:16:04,325 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash 251128320, now seen corresponding path program 1 times [2019-12-18 16:16:04,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:04,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500411929] [2019-12-18 16:16:04,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:04,392 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-18 16:16:04,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500411929] [2019-12-18 16:16:04,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:04,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:16:04,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662009125] [2019-12-18 16:16:04,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:16:04,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:16:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:16:04,394 INFO L87 Difference]: Start difference. First operand 14509 states and 48816 transitions. Second operand 4 states. [2019-12-18 16:16:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:04,483 INFO L93 Difference]: Finished difference Result 16649 states and 54453 transitions. [2019-12-18 16:16:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:16:04,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-18 16:16:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:04,514 INFO L225 Difference]: With dead ends: 16649 [2019-12-18 16:16:04,514 INFO L226 Difference]: Without dead ends: 14521 [2019-12-18 16:16:04,515 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-18 16:16:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2019-12-18 16:16:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 14192. [2019-12-18 16:16:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14192 states. [2019-12-18 16:16:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 47747 transitions. [2019-12-18 16:16:06,472 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 47747 transitions. Word has length 48 [2019-12-18 16:16:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:06,472 INFO L462 AbstractCegarLoop]: Abstraction has 14192 states and 47747 transitions. [2019-12-18 16:16:06,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:16:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 47747 transitions. [2019-12-18 16:16:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 16:16:06,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:06,489 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] [2019-12-18 16:16:06,489 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -573504060, now seen corresponding path program 2 times [2019-12-18 16:16:06,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:06,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7778497] [2019-12-18 16:16:06,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:06,556 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-18 16:16:06,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7778497] [2019-12-18 16:16:06,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:06,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:16:06,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434562419] [2019-12-18 16:16:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:16:06,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:16:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:16:06,558 INFO L87 Difference]: Start difference. First operand 14192 states and 47747 transitions. Second operand 4 states. [2019-12-18 16:16:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:06,648 INFO L93 Difference]: Finished difference Result 18738 states and 58813 transitions. [2019-12-18 16:16:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:16:06,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-18 16:16:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:06,680 INFO L225 Difference]: With dead ends: 18738 [2019-12-18 16:16:06,680 INFO L226 Difference]: Without dead ends: 14193 [2019-12-18 16:16:06,681 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-18 16:16:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2019-12-18 16:16:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 13835. [2019-12-18 16:16:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13835 states. [2019-12-18 16:16:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13835 states to 13835 states and 43683 transitions. [2019-12-18 16:16:06,880 INFO L78 Accepts]: Start accepts. Automaton has 13835 states and 43683 transitions. Word has length 48 [2019-12-18 16:16:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 13835 states and 43683 transitions. [2019-12-18 16:16:06,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:16:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 43683 transitions. [2019-12-18 16:16:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 16:16:06,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:06,897 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] [2019-12-18 16:16:06,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash -259750390, now seen corresponding path program 3 times [2019-12-18 16:16:06,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:06,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308624634] [2019-12-18 16:16:06,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:06,947 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-18 16:16:06,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308624634] [2019-12-18 16:16:06,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:06,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:16:06,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471483384] [2019-12-18 16:16:06,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:16:06,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:06,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:16:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:16:06,949 INFO L87 Difference]: Start difference. First operand 13835 states and 43683 transitions. Second operand 3 states. [2019-12-18 16:16:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:07,030 INFO L93 Difference]: Finished difference Result 20790 states and 60931 transitions. [2019-12-18 16:16:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:16:07,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-18 16:16:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:07,052 INFO L225 Difference]: With dead ends: 20790 [2019-12-18 16:16:07,052 INFO L226 Difference]: Without dead ends: 11223 [2019-12-18 16:16:07,052 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-18 16:16:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11223 states. [2019-12-18 16:16:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11223 to 10822. [2019-12-18 16:16:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2019-12-18 16:16:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 27555 transitions. [2019-12-18 16:16:07,253 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 27555 transitions. Word has length 48 [2019-12-18 16:16:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:07,253 INFO L462 AbstractCegarLoop]: Abstraction has 10822 states and 27555 transitions. [2019-12-18 16:16:07,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:16:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 27555 transitions. [2019-12-18 16:16:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 16:16:07,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:07,267 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] [2019-12-18 16:16:07,267 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2068669838, now seen corresponding path program 4 times [2019-12-18 16:16:07,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:07,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71395660] [2019-12-18 16:16:07,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:07,327 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-18 16:16:07,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71395660] [2019-12-18 16:16:07,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:07,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:16:07,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588934124] [2019-12-18 16:16:07,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:16:07,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:16:07,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:16:07,329 INFO L87 Difference]: Start difference. First operand 10822 states and 27555 transitions. Second operand 5 states. [2019-12-18 16:16:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:07,507 INFO L93 Difference]: Finished difference Result 18692 states and 47751 transitions. [2019-12-18 16:16:07,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:16:07,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-18 16:16:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:07,533 INFO L225 Difference]: With dead ends: 18692 [2019-12-18 16:16:07,533 INFO L226 Difference]: Without dead ends: 14517 [2019-12-18 16:16:07,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:16:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14517 states. [2019-12-18 16:16:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14517 to 14413. [2019-12-18 16:16:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14413 states. [2019-12-18 16:16:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14413 states to 14413 states and 37042 transitions. [2019-12-18 16:16:07,790 INFO L78 Accepts]: Start accepts. Automaton has 14413 states and 37042 transitions. Word has length 48 [2019-12-18 16:16:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:07,793 INFO L462 AbstractCegarLoop]: Abstraction has 14413 states and 37042 transitions. [2019-12-18 16:16:07,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:16:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14413 states and 37042 transitions. [2019-12-18 16:16:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-18 16:16:07,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:07,811 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] [2019-12-18 16:16:07,812 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1684842545, now seen corresponding path program 1 times [2019-12-18 16:16:07,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:07,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128745388] [2019-12-18 16:16:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:07,915 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-18 16:16:07,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128745388] [2019-12-18 16:16:07,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:07,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:16:07,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825307138] [2019-12-18 16:16:07,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:16:07,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:16:07,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:16:07,917 INFO L87 Difference]: Start difference. First operand 14413 states and 37042 transitions. Second operand 5 states. [2019-12-18 16:16:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:08,422 INFO L93 Difference]: Finished difference Result 15978 states and 40667 transitions. [2019-12-18 16:16:08,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:16:08,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-18 16:16:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:08,448 INFO L225 Difference]: With dead ends: 15978 [2019-12-18 16:16:08,448 INFO L226 Difference]: Without dead ends: 15978 [2019-12-18 16:16:08,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:16:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2019-12-18 16:16:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 15463. [2019-12-18 16:16:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15463 states. [2019-12-18 16:16:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15463 states to 15463 states and 39545 transitions. [2019-12-18 16:16:08,791 INFO L78 Accepts]: Start accepts. Automaton has 15463 states and 39545 transitions. Word has length 49 [2019-12-18 16:16:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:08,792 INFO L462 AbstractCegarLoop]: Abstraction has 15463 states and 39545 transitions. [2019-12-18 16:16:08,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:16:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15463 states and 39545 transitions. [2019-12-18 16:16:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:16:08,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:08,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:16:08,807 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 1 times [2019-12-18 16:16:08,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:08,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970180191] [2019-12-18 16:16:08,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:08,900 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-18 16:16:08,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970180191] [2019-12-18 16:16:08,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:08,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:16:08,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637838754] [2019-12-18 16:16:08,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:16:08,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:08,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:16:08,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:16:08,902 INFO L87 Difference]: Start difference. First operand 15463 states and 39545 transitions. Second operand 7 states. [2019-12-18 16:16:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:09,062 INFO L93 Difference]: Finished difference Result 14053 states and 36097 transitions. [2019-12-18 16:16:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:16:09,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 16:16:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:09,064 INFO L225 Difference]: With dead ends: 14053 [2019-12-18 16:16:09,064 INFO L226 Difference]: Without dead ends: 999 [2019-12-18 16:16:09,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:16:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-18 16:16:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 960. [2019-12-18 16:16:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-18 16:16:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2091 transitions. [2019-12-18 16:16:09,078 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2091 transitions. Word has length 50 [2019-12-18 16:16:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:09,078 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2091 transitions. [2019-12-18 16:16:09,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:16:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2091 transitions. [2019-12-18 16:16:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:16:09,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:09,080 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-18 16:16:09,080 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:09,081 INFO L82 PathProgramCache]: Analyzing trace with hash 6072705, now seen corresponding path program 1 times [2019-12-18 16:16:09,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:09,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626345041] [2019-12-18 16:16:09,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:09,163 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-18 16:16:09,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626345041] [2019-12-18 16:16:09,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:09,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:16:09,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707450876] [2019-12-18 16:16:09,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:16:09,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:16:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:16:09,166 INFO L87 Difference]: Start difference. First operand 960 states and 2091 transitions. Second operand 7 states. [2019-12-18 16:16:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:09,342 INFO L93 Difference]: Finished difference Result 1699 states and 3619 transitions. [2019-12-18 16:16:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:16:09,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:16:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:09,345 INFO L225 Difference]: With dead ends: 1699 [2019-12-18 16:16:09,345 INFO L226 Difference]: Without dead ends: 1335 [2019-12-18 16:16:09,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:16:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-18 16:16:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1046. [2019-12-18 16:16:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-12-18 16:16:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2258 transitions. [2019-12-18 16:16:09,357 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 2258 transitions. Word has length 65 [2019-12-18 16:16:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:09,357 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 2258 transitions. [2019-12-18 16:16:09,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:16:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 2258 transitions. [2019-12-18 16:16:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:16:09,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:09,358 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-18 16:16:09,358 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash -959477119, now seen corresponding path program 2 times [2019-12-18 16:16:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:09,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906504738] [2019-12-18 16:16:09,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:09,476 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-18 16:16:09,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906504738] [2019-12-18 16:16:09,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:09,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:16:09,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335017338] [2019-12-18 16:16:09,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:16:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:16:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:16:09,481 INFO L87 Difference]: Start difference. First operand 1046 states and 2258 transitions. Second operand 8 states. [2019-12-18 16:16:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:10,068 INFO L93 Difference]: Finished difference Result 1921 states and 4080 transitions. [2019-12-18 16:16:10,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:16:10,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:16:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:10,071 INFO L225 Difference]: With dead ends: 1921 [2019-12-18 16:16:10,071 INFO L226 Difference]: Without dead ends: 1921 [2019-12-18 16:16:10,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:16:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-12-18 16:16:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1222. [2019-12-18 16:16:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 16:16:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2636 transitions. [2019-12-18 16:16:10,089 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2636 transitions. Word has length 65 [2019-12-18 16:16:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:10,090 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2636 transitions. [2019-12-18 16:16:10,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:16:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2636 transitions. [2019-12-18 16:16:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:16:10,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:10,092 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-18 16:16:10,092 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1584542315, now seen corresponding path program 3 times [2019-12-18 16:16:10,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:10,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105480905] [2019-12-18 16:16:10,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:10,168 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-18 16:16:10,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105480905] [2019-12-18 16:16:10,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:10,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:16:10,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457524713] [2019-12-18 16:16:10,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:16:10,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:16:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:16:10,171 INFO L87 Difference]: Start difference. First operand 1222 states and 2636 transitions. Second operand 8 states. [2019-12-18 16:16:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:10,412 INFO L93 Difference]: Finished difference Result 2658 states and 5666 transitions. [2019-12-18 16:16:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:16:10,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:16:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:10,415 INFO L225 Difference]: With dead ends: 2658 [2019-12-18 16:16:10,415 INFO L226 Difference]: Without dead ends: 2310 [2019-12-18 16:16:10,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:16:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-12-18 16:16:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1316. [2019-12-18 16:16:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-18 16:16:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2901 transitions. [2019-12-18 16:16:10,439 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2901 transitions. Word has length 65 [2019-12-18 16:16:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:10,440 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2901 transitions. [2019-12-18 16:16:10,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:16:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2901 transitions. [2019-12-18 16:16:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:16:10,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:10,442 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-18 16:16:10,442 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 802249601, now seen corresponding path program 4 times [2019-12-18 16:16:10,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:10,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360512559] [2019-12-18 16:16:10,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:16:10,512 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-18 16:16:10,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360512559] [2019-12-18 16:16:10,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:16:10,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:16:10,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698073185] [2019-12-18 16:16:10,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:16:10,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:16:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:16:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:16:10,514 INFO L87 Difference]: Start difference. First operand 1316 states and 2901 transitions. Second operand 3 states. [2019-12-18 16:16:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:16:10,531 INFO L93 Difference]: Finished difference Result 1316 states and 2900 transitions. [2019-12-18 16:16:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:16:10,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:16:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:16:10,534 INFO L225 Difference]: With dead ends: 1316 [2019-12-18 16:16:10,534 INFO L226 Difference]: Without dead ends: 1316 [2019-12-18 16:16:10,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:16:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-12-18 16:16:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1236. [2019-12-18 16:16:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2019-12-18 16:16:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 2757 transitions. [2019-12-18 16:16:10,554 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 2757 transitions. Word has length 65 [2019-12-18 16:16:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:16:10,555 INFO L462 AbstractCegarLoop]: Abstraction has 1236 states and 2757 transitions. [2019-12-18 16:16:10,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:16:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 2757 transitions. [2019-12-18 16:16:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:16:10,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:16:10,557 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-18 16:16:10,557 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:16:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:16:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 1 times [2019-12-18 16:16:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:16:10,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514201080] [2019-12-18 16:16:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:16:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:16:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:16:10,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:16:10,718 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:16:10,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44|)) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= |v_ULTIMATE.start_main_~#t205~0.offset_28| 0) (= 0 v_~z$r_buff0_thd3~0_418) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t205~0.base_44|) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t205~0.base_44|) |v_ULTIMATE.start_main_~#t205~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$w_buff0~0_341 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t205~0.base_44| 4)) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t205~0.base_44| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t205~0.offset=|v_ULTIMATE.start_main_~#t205~0.offset_28|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_18|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t205~0.base=|v_ULTIMATE.start_main_~#t205~0.base_44|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t205~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t208~0.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t206~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t208~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t206~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t207~0.offset, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t207~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t205~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:16:10,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t206~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t206~0.base_11|)) (= |v_ULTIMATE.start_main_~#t206~0.offset_10| 0) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t206~0.base_11|) |v_ULTIMATE.start_main_~#t206~0.offset_10| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t206~0.base_11|) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t206~0.base_11| 1) |v_#valid_44|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t206~0.base=|v_ULTIMATE.start_main_~#t206~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t206~0.offset=|v_ULTIMATE.start_main_~#t206~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t206~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t206~0.offset] because there is no mapped edge [2019-12-18 16:16:10,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t207~0.base_12|) |v_ULTIMATE.start_main_~#t207~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12| 1) |v_#valid_48|) (= |v_ULTIMATE.start_main_~#t207~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t207~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t207~0.base_12| 0)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t207~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t207~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t207~0.offset=|v_ULTIMATE.start_main_~#t207~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t207~0.base=|v_ULTIMATE.start_main_~#t207~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t207~0.offset, #length, ULTIMATE.start_main_~#t207~0.base] because there is no mapped edge [2019-12-18 16:16:10,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t208~0.base_13|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t208~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t208~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t208~0.offset_11| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t208~0.base_13|) |v_ULTIMATE.start_main_~#t208~0.offset_11| 3)) |v_#memory_int_23|) (not (= 0 |v_ULTIMATE.start_main_~#t208~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t208~0.base=|v_ULTIMATE.start_main_~#t208~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t208~0.offset=|v_ULTIMATE.start_main_~#t208~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t208~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t208~0.offset] because there is no mapped edge [2019-12-18 16:16:10,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_9 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_9) (= 1 v_~z$w_buff0~0_34) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= (mod v_~z$w_buff1_used~0_57 256) 0) (= v_~z$w_buff0_used~0_105 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_9, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 16:16:10,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In953948900 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In953948900 256) 0)) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out953948900| |P3Thread1of1ForFork2_#t~ite28_Out953948900|))) (or (and (= ~z$w_buff1~0_In953948900 |P3Thread1of1ForFork2_#t~ite28_Out953948900|) .cse0 (or .cse1 .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out953948900| ~z$w_buff0~0_In953948900) (not .cse1) (not .cse2) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In953948900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In953948900, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In953948900, ~z$w_buff1~0=~z$w_buff1~0_In953948900} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out953948900|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out953948900|, ~z$w_buff0~0=~z$w_buff0~0_In953948900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In953948900, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In953948900, ~z$w_buff1~0=~z$w_buff1~0_In953948900} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 16:16:10,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 16:16:10,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-2136924404 256)))) (or (and (= ~z~0_In-2136924404 |P3Thread1of1ForFork2_#t~ite48_Out-2136924404|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-2136924404| ~z$mem_tmp~0_In-2136924404)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2136924404, ~z$flush_delayed~0=~z$flush_delayed~0_In-2136924404, ~z~0=~z~0_In-2136924404} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2136924404, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-2136924404|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2136924404, ~z~0=~z~0_In-2136924404} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 16:16:10,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_10)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 16:16:10,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 16:16:10,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In2060439117 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In2060439117 |P2Thread1of1ForFork1_#t~ite25_Out2060439117|)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out2060439117| ~z~0_In2060439117) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2060439117, ~z$flush_delayed~0=~z$flush_delayed~0_In2060439117, ~z~0=~z~0_In2060439117} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2060439117, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out2060439117|, ~z$flush_delayed~0=~z$flush_delayed~0_In2060439117, ~z~0=~z~0_In2060439117} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 16:16:10,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1611418961 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1611418961 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1611418961|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1611418961 |P3Thread1of1ForFork2_#t~ite51_Out-1611418961|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1611418961, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1611418961} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1611418961|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1611418961, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1611418961} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 16:16:10,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1007122578 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1007122578 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1007122578 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1007122578 256) 0))) (or (and (= ~z$w_buff1_used~0_In1007122578 |P3Thread1of1ForFork2_#t~ite52_Out1007122578|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1007122578|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1007122578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1007122578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1007122578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1007122578} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1007122578|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1007122578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1007122578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1007122578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1007122578} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 16:16:10,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1647683147 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1647683147 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1647683147) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1647683147 ~z$r_buff0_thd4~0_Out-1647683147)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1647683147, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1647683147} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1647683147|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1647683147, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1647683147} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 16:16:10,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-281212453 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-281212453 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-281212453 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-281212453 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-281212453| ~z$r_buff1_thd4~0_In-281212453) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-281212453| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-281212453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-281212453, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-281212453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-281212453} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-281212453|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-281212453, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-281212453, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-281212453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-281212453} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 16:16:10,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite54_32| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_31|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:16:10,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 v_~z$flush_delayed~0_189) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_46|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_45|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 16:16:10,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:16:10,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-848212166 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-848212166 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-848212166| |ULTIMATE.start_main_#t~ite60_Out-848212166|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite59_Out-848212166| ~z~0_In-848212166)) (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In-848212166 |ULTIMATE.start_main_#t~ite59_Out-848212166|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-848212166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-848212166, ~z$w_buff1~0=~z$w_buff1~0_In-848212166, ~z~0=~z~0_In-848212166} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-848212166|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-848212166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-848212166, ~z$w_buff1~0=~z$w_buff1~0_In-848212166, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-848212166|, ~z~0=~z~0_In-848212166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:16:10,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1214718018 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1214718018 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1214718018| ~z$w_buff0_used~0_In-1214718018) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1214718018| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214718018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214718018} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214718018, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1214718018|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214718018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:16:10,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1792043584 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1792043584 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1792043584 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1792043584 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1792043584|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1792043584| ~z$w_buff1_used~0_In1792043584)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792043584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792043584, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792043584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792043584} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1792043584|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792043584, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792043584, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792043584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792043584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:16:10,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-883911072 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-883911072 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-883911072|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-883911072| ~z$r_buff0_thd0~0_In-883911072) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-883911072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883911072} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-883911072|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-883911072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883911072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 16:16:10,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-592145415 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-592145415 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-592145415 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-592145415 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out-592145415| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-592145415| ~z$r_buff1_thd0~0_In-592145415)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-592145415, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-592145415, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-592145415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-592145415} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-592145415, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-592145415, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-592145415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-592145415, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-592145415|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 16:16:10,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:16:10,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:16:10 BasicIcfg [2019-12-18 16:16:10,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:16:10,915 INFO L168 Benchmark]: Toolchain (without parser) took 128994.17 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 863.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,917 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 16:16:10,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.94 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 155.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,920 INFO L168 Benchmark]: Boogie Preprocessor took 44.16 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,920 INFO L168 Benchmark]: RCFGBuilder took 939.23 ms. Allocated memory is still 202.9 MB. Free memory was 149.2 MB in the beginning and 91.7 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,921 INFO L168 Benchmark]: TraceAbstraction took 127081.89 ms. Allocated memory was 236.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 206.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 878.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:16:10,926 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.47 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.94 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 155.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.16 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 939.23 ms. Allocated memory is still 202.9 MB. Free memory was 149.2 MB in the beginning and 91.7 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127081.89 ms. Allocated memory was 236.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 206.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 878.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.2s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t205, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t206, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t207, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t208, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 126.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3987 SDtfs, 5536 SDslu, 7177 SDs, 0 SdLazy, 2334 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141658occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 70.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 112361 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 107682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...