/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:36:48,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:36:48,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:36:48,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:36:48,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:36:48,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:36:48,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:36:48,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:36:48,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:36:48,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:36:48,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:36:48,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:36:48,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:36:48,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:36:48,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:36:48,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:36:48,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:36:48,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:36:48,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:36:48,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:36:48,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:36:48,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:36:48,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:36:48,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:36:48,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:36:48,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:36:48,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:36:48,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:36:48,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:36:48,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:36:48,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:36:48,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:36:48,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:36:48,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:36:48,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:36:48,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:36:48,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:36:48,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:36:48,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:36:48,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:36:48,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:36:48,599 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-VariableLbe.epf [2019-12-27 06:36:48,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:36:48,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:36:48,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:36:48,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:36:48,621 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:36:48,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:36:48,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:36:48,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:36:48,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:36:48,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:36:48,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:36:48,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:36:48,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:36:48,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:36:48,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:36:48,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:36:48,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:36:48,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:36:48,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:36:48,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:36:48,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:36:48,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:36:48,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:36:48,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:36:48,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:36:48,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:36:48,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:36:48,627 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:36:48,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:36:48,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:36:48,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:36:48,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:36:48,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:36:48,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:36:48,956 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:36:48,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-27 06:36:49,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf8a3d1/ad05492eacc442dd8918a46bc994db0d/FLAGeb5bbada9 [2019-12-27 06:36:49,575 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:36:49,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-27 06:36:49,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf8a3d1/ad05492eacc442dd8918a46bc994db0d/FLAGeb5bbada9 [2019-12-27 06:36:49,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acf8a3d1/ad05492eacc442dd8918a46bc994db0d [2019-12-27 06:36:49,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:36:49,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:36:49,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:36:49,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:36:49,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:36:49,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:49" (1/1) ... [2019-12-27 06:36:49,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:49, skipping insertion in model container [2019-12-27 06:36:49,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:49" (1/1) ... [2019-12-27 06:36:49,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:36:49,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:36:50,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:36:50,538 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:36:50,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:36:50,697 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:36:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50 WrapperNode [2019-12-27 06:36:50,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:36:50,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:36:50,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:36:50,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:36:50,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:36:50,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:36:50,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:36:50,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:36:50,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... [2019-12-27 06:36:50,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:36:50,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:36:50,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:36:50,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:36:50,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:36:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:36:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:36:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:36:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:36:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:36:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:36:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:36:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:36:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:36:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:36:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:36:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:36:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:36:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:36:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:36:50,885 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:36:51,630 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:36:51,631 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:36:51,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:51 BoogieIcfgContainer [2019-12-27 06:36:51,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:36:51,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:36:51,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:36:51,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:36:51,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:36:49" (1/3) ... [2019-12-27 06:36:51,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c194673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:51, skipping insertion in model container [2019-12-27 06:36:51,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:50" (2/3) ... [2019-12-27 06:36:51,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c194673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:51, skipping insertion in model container [2019-12-27 06:36:51,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:51" (3/3) ... [2019-12-27 06:36:51,643 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2019-12-27 06:36:51,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:36:51,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:36:51,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:36:51,660 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:36:51,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,710 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,711 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,711 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,711 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,712 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,732 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,746 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,746 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,749 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,750 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:51,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:36:51,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:36:51,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:36:51,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:36:51,782 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:36:51,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:36:51,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:36:51,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:36:51,782 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:36:51,802 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 06:36:51,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:36:51,916 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:36:51,917 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:36:51,930 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:36:51,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:36:52,000 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:36:52,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:36:52,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:36:52,022 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:36:52,024 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:36:55,515 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:36:55,657 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:36:55,684 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 06:36:55,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:36:55,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 06:36:59,048 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 06:36:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 06:36:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:36:59,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:59,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:59,058 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 06:36:59,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:59,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625166219] [2019-12-27 06:36:59,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:36:59,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625166219] [2019-12-27 06:36:59,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:36:59,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788548915] [2019-12-27 06:36:59,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:59,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:59,424 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 06:37:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:00,024 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 06:37:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:37:00,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:37:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:00,321 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 06:37:00,322 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 06:37:00,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 06:37:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 06:37:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 06:37:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 06:37:02,349 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 06:37:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:02,350 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 06:37:02,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:37:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 06:37:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:37:02,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:02,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:02,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 06:37:02,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:02,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133137662] [2019-12-27 06:37:02,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:02,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133137662] [2019-12-27 06:37:02,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:02,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:37:02,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986914400] [2019-12-27 06:37:02,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:37:02,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:37:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:37:02,505 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-27 06:37:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:04,730 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 06:37:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:37:04,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:37:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:05,164 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 06:37:05,164 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 06:37:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:37:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 06:37:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 06:37:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 06:37:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 06:37:07,401 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 06:37:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:07,401 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 06:37:07,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:37:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 06:37:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:37:07,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:07,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:07,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 06:37:07,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:07,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138258119] [2019-12-27 06:37:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:07,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138258119] [2019-12-27 06:37:07,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:07,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:37:07,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475184800] [2019-12-27 06:37:07,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:37:07,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:07,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:37:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:07,487 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 06:37:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:07,711 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 06:37:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:37:07,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:37:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:09,972 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 06:37:09,972 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 06:37:09,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 06:37:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 06:37:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 06:37:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 06:37:10,984 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 06:37:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:10,984 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 06:37:10,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:37:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 06:37:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:37:10,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:10,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:10,987 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 06:37:10,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:10,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642271725] [2019-12-27 06:37:10,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:11,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642271725] [2019-12-27 06:37:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:37:11,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150761603] [2019-12-27 06:37:11,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:37:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:37:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:37:11,063 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 06:37:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:11,132 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 06:37:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:37:11,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:37:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:11,157 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 06:37:11,157 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 06:37:11,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:37:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 06:37:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 06:37:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 06:37:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 06:37:11,467 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 06:37:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:11,467 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 06:37:11,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:37:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 06:37:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:37:11,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:11,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:11,470 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 06:37:11,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:11,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370292559] [2019-12-27 06:37:11,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:11,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370292559] [2019-12-27 06:37:11,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:37:11,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272417987] [2019-12-27 06:37:11,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:37:11,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:37:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:37:11,536 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-27 06:37:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:11,585 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 06:37:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:37:11,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:37:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:11,590 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 06:37:11,590 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 06:37:11,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:37:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 06:37:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 06:37:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 06:37:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 06:37:11,638 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 06:37:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:11,638 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 06:37:11,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:37:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 06:37:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:37:11,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:11,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:11,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 06:37:11,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:11,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255561448] [2019-12-27 06:37:11,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:11,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255561448] [2019-12-27 06:37:11,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:11,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:37:11,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577384458] [2019-12-27 06:37:11,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:37:11,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:37:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:37:11,780 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-27 06:37:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:11,826 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 06:37:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:37:11,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 06:37:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:11,830 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 06:37:11,830 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 06:37:11,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:37:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 06:37:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 06:37:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 06:37:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 06:37:11,851 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 06:37:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:11,851 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 06:37:11,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:37:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 06:37:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:37:11,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:11,859 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] [2019-12-27 06:37:11,860 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 06:37:11,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:11,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788914348] [2019-12-27 06:37:11,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:12,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788914348] [2019-12-27 06:37:12,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:12,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:37:12,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93527919] [2019-12-27 06:37:12,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:37:12,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:37:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:12,009 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 06:37:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:12,055 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 06:37:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:37:12,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:37:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:12,058 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 06:37:12,058 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 06:37:12,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 06:37:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 06:37:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 06:37:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 06:37:12,073 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 06:37:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:12,074 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 06:37:12,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:37:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 06:37:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:37:12,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:12,110 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] [2019-12-27 06:37:12,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 06:37:12,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:12,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363909977] [2019-12-27 06:37:12,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:12,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363909977] [2019-12-27 06:37:12,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:12,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:37:12,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300243525] [2019-12-27 06:37:12,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:37:12,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:37:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:37:12,220 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 06:37:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:12,444 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 06:37:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:37:12,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:37:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:12,448 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 06:37:12,448 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 06:37:12,448 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-27 06:37:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 06:37:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 06:37:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 06:37:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 06:37:12,466 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 06:37:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:12,466 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 06:37:12,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:37:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 06:37:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:37:12,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:12,474 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] [2019-12-27 06:37:12,474 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:12,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:12,474 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 06:37:12,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:12,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951466929] [2019-12-27 06:37:12,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:12,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951466929] [2019-12-27 06:37:12,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:12,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:37:12,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885735178] [2019-12-27 06:37:12,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:37:12,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:37:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:37:12,625 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-27 06:37:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:12,959 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-27 06:37:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:37:12,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:37:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:12,964 INFO L225 Difference]: With dead ends: 2369 [2019-12-27 06:37:12,964 INFO L226 Difference]: Without dead ends: 2369 [2019-12-27 06:37:12,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:37:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-27 06:37:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-27 06:37:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 06:37:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 06:37:12,996 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 06:37:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:12,996 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 06:37:12,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:37:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 06:37:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:37:13,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:13,001 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] [2019-12-27 06:37:13,001 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 06:37:13,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:13,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856635656] [2019-12-27 06:37:13,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:13,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856635656] [2019-12-27 06:37:13,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:13,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:37:13,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071594401] [2019-12-27 06:37:13,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:37:13,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:37:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:37:13,126 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 06:37:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:13,507 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 06:37:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:37:13,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:37:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:13,516 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 06:37:13,516 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 06:37:13,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:37:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 06:37:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 06:37:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 06:37:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 06:37:13,541 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 06:37:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:13,541 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 06:37:13,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:37:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 06:37:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:37:13,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:13,545 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] [2019-12-27 06:37:13,545 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 06:37:13,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:13,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711465769] [2019-12-27 06:37:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711465769] [2019-12-27 06:37:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:37:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067500902] [2019-12-27 06:37:13,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:37:13,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:37:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:37:13,673 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 8 states. [2019-12-27 06:37:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:14,055 INFO L93 Difference]: Finished difference Result 2633 states and 7491 transitions. [2019-12-27 06:37:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:37:14,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 06:37:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:14,061 INFO L225 Difference]: With dead ends: 2633 [2019-12-27 06:37:14,061 INFO L226 Difference]: Without dead ends: 2633 [2019-12-27 06:37:14,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:37:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2019-12-27 06:37:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 1606. [2019-12-27 06:37:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 06:37:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4617 transitions. [2019-12-27 06:37:14,085 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 4617 transitions. Word has length 58 [2019-12-27 06:37:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:14,085 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 4617 transitions. [2019-12-27 06:37:14,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:37:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 4617 transitions. [2019-12-27 06:37:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:37:14,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:14,089 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] [2019-12-27 06:37:14,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-27 06:37:14,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:14,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716103036] [2019-12-27 06:37:14,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:14,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716103036] [2019-12-27 06:37:14,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:14,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:37:14,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796041523] [2019-12-27 06:37:14,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:37:14,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:37:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:37:14,282 INFO L87 Difference]: Start difference. First operand 1606 states and 4617 transitions. Second operand 7 states. [2019-12-27 06:37:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:14,452 INFO L93 Difference]: Finished difference Result 3236 states and 8713 transitions. [2019-12-27 06:37:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:37:14,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 06:37:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:14,457 INFO L225 Difference]: With dead ends: 3236 [2019-12-27 06:37:14,457 INFO L226 Difference]: Without dead ends: 2334 [2019-12-27 06:37:14,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:37:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2019-12-27 06:37:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 1476. [2019-12-27 06:37:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-27 06:37:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-27 06:37:14,490 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 59 [2019-12-27 06:37:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-27 06:37:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:37:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-27 06:37:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:37:14,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:14,494 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] [2019-12-27 06:37:14,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 2 times [2019-12-27 06:37:14,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:14,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62269556] [2019-12-27 06:37:14,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:14,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62269556] [2019-12-27 06:37:14,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:14,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:37:14,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969896546] [2019-12-27 06:37:14,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:37:14,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:14,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:37:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:37:14,643 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 7 states. [2019-12-27 06:37:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:14,788 INFO L93 Difference]: Finished difference Result 2685 states and 7067 transitions. [2019-12-27 06:37:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:37:14,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 06:37:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:14,792 INFO L225 Difference]: With dead ends: 2685 [2019-12-27 06:37:14,792 INFO L226 Difference]: Without dead ends: 1557 [2019-12-27 06:37:14,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:37:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2019-12-27 06:37:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1088. [2019-12-27 06:37:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-12-27 06:37:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2717 transitions. [2019-12-27 06:37:14,817 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2717 transitions. Word has length 59 [2019-12-27 06:37:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:14,817 INFO L462 AbstractCegarLoop]: Abstraction has 1088 states and 2717 transitions. [2019-12-27 06:37:14,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:37:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2717 transitions. [2019-12-27 06:37:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:37:14,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:14,820 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] [2019-12-27 06:37:14,820 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1600996218, now seen corresponding path program 3 times [2019-12-27 06:37:14,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:14,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925089390] [2019-12-27 06:37:14,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:14,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925089390] [2019-12-27 06:37:14,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:14,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:37:14,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265713896] [2019-12-27 06:37:14,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:37:14,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:14,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:37:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:14,905 INFO L87 Difference]: Start difference. First operand 1088 states and 2717 transitions. Second operand 3 states. [2019-12-27 06:37:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:14,946 INFO L93 Difference]: Finished difference Result 1087 states and 2715 transitions. [2019-12-27 06:37:14,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:37:14,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:37:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:14,948 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 06:37:14,949 INFO L226 Difference]: Without dead ends: 1087 [2019-12-27 06:37:14,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-12-27 06:37:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 693. [2019-12-27 06:37:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-27 06:37:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1734 transitions. [2019-12-27 06:37:14,964 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1734 transitions. Word has length 59 [2019-12-27 06:37:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:14,965 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1734 transitions. [2019-12-27 06:37:14,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:37:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1734 transitions. [2019-12-27 06:37:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:37:14,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:14,967 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] [2019-12-27 06:37:14,967 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 1 times [2019-12-27 06:37:14,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:14,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466156919] [2019-12-27 06:37:14,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466156919] [2019-12-27 06:37:15,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:15,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:37:15,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893151537] [2019-12-27 06:37:15,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:37:15,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:37:15,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:15,038 INFO L87 Difference]: Start difference. First operand 693 states and 1734 transitions. Second operand 3 states. [2019-12-27 06:37:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:15,065 INFO L93 Difference]: Finished difference Result 652 states and 1580 transitions. [2019-12-27 06:37:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:37:15,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:37:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:15,067 INFO L225 Difference]: With dead ends: 652 [2019-12-27 06:37:15,067 INFO L226 Difference]: Without dead ends: 652 [2019-12-27 06:37:15,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:37:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-27 06:37:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 604. [2019-12-27 06:37:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:37:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-27 06:37:15,080 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 59 [2019-12-27 06:37:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:15,080 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-27 06:37:15,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:37:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-27 06:37:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:37:15,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:15,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:15,082 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 1 times [2019-12-27 06:37:15,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:15,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781769641] [2019-12-27 06:37:15,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:15,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781769641] [2019-12-27 06:37:15,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:15,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:37:15,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738414517] [2019-12-27 06:37:15,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:37:15,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:37:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:37:15,277 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 6 states. [2019-12-27 06:37:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:15,380 INFO L93 Difference]: Finished difference Result 889 states and 2055 transitions. [2019-12-27 06:37:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:37:15,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 06:37:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:15,381 INFO L225 Difference]: With dead ends: 889 [2019-12-27 06:37:15,382 INFO L226 Difference]: Without dead ends: 260 [2019-12-27 06:37:15,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:37:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-27 06:37:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2019-12-27 06:37:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 06:37:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 06:37:15,387 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-27 06:37:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:15,388 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 06:37:15,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:37:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 06:37:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:37:15,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:15,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:37:15,390 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 2 times [2019-12-27 06:37:15,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:15,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054130711] [2019-12-27 06:37:15,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:15,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054130711] [2019-12-27 06:37:15,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:15,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:37:15,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330261440] [2019-12-27 06:37:15,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:37:15,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:37:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:37:15,718 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-27 06:37:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:16,270 INFO L93 Difference]: Finished difference Result 401 states and 694 transitions. [2019-12-27 06:37:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:37:16,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:37:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:16,272 INFO L225 Difference]: With dead ends: 401 [2019-12-27 06:37:16,272 INFO L226 Difference]: Without dead ends: 370 [2019-12-27 06:37:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:37:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-27 06:37:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2019-12-27 06:37:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 06:37:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 590 transitions. [2019-12-27 06:37:16,278 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 590 transitions. Word has length 60 [2019-12-27 06:37:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:16,278 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 590 transitions. [2019-12-27 06:37:16,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:37:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 590 transitions. [2019-12-27 06:37:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:37:16,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:16,279 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] [2019-12-27 06:37:16,280 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1131398243, now seen corresponding path program 3 times [2019-12-27 06:37:16,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:16,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32106884] [2019-12-27 06:37:16,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:37:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:37:16,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32106884] [2019-12-27 06:37:16,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:37:16,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:37:16,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674459639] [2019-12-27 06:37:16,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:37:16,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:37:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:37:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:37:16,531 INFO L87 Difference]: Start difference. First operand 336 states and 590 transitions. Second operand 12 states. [2019-12-27 06:37:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:37:16,872 INFO L93 Difference]: Finished difference Result 437 states and 745 transitions. [2019-12-27 06:37:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:37:16,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 06:37:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:37:16,874 INFO L225 Difference]: With dead ends: 437 [2019-12-27 06:37:16,874 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 06:37:16,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:37:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 06:37:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 344. [2019-12-27 06:37:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 06:37:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 06:37:16,880 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 06:37:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:37:16,880 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 06:37:16,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:37:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 06:37:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:37:16,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:37:16,881 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] [2019-12-27 06:37:16,881 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:37:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:37:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 4 times [2019-12-27 06:37:16,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:37:16,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814166468] [2019-12-27 06:37:16,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:37:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:37:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:37:17,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:37:17,004 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:37:17,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1229~0.base_19| 4)) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19|) |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19| 1) |v_#valid_70|) (= |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1229~0.base_19|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19|) 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_~#t1229~0.base=|v_ULTIMATE.start_main_~#t1229~0.base_19|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_11, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1229~0.offset=|v_ULTIMATE.start_main_~#t1229~0.offset_16|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_22|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_16|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1230~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1231~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1229~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1230~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1229~0.offset, ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1231~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:37:17,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1230~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1230~0.base_13| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13|) |v_ULTIMATE.start_main_~#t1230~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1230~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13| 1) |v_#valid_48|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1230~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1230~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1230~0.base, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:37:17,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1231~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1231~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1231~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1231~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12|) |v_ULTIMATE.start_main_~#t1231~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_12|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1231~0.base, ULTIMATE.start_main_~#t1231~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:37:17,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1232~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12| 1) |v_#valid_39|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12|) |v_ULTIMATE.start_main_~#t1232~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1232~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_12|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:37:17,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:37:17,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:37:17,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:37:17,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In584448312 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In584448312 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out584448312| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In584448312 |P3Thread1of1ForFork3_#t~ite11_Out584448312|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In584448312, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584448312} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In584448312, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584448312, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out584448312|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:37:17,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1722763791 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1722763791 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1722763791 |P2Thread1of1ForFork2_#t~ite3_Out-1722763791|)) (and (or .cse1 .cse0) (= ~z~0_In-1722763791 |P2Thread1of1ForFork2_#t~ite3_Out-1722763791|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1722763791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1722763791, ~z$w_buff1~0=~z$w_buff1~0_In-1722763791, ~z~0=~z~0_In-1722763791} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1722763791|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1722763791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1722763791, ~z$w_buff1~0=~z$w_buff1~0_In-1722763791, ~z~0=~z~0_In-1722763791} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:37:17,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1950701250 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1950701250 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1950701250 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1950701250 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out1950701250| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1950701250 |P3Thread1of1ForFork3_#t~ite12_Out1950701250|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1950701250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1950701250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1950701250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1950701250} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1950701250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1950701250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1950701250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1950701250, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1950701250|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:37:17,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-452395223 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-452395223 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-452395223 ~z$r_buff0_thd4~0_In-452395223)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-452395223) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-452395223, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-452395223} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-452395223, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-452395223, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-452395223|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:37:17,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1278671096 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1278671096 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1278671096 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1278671096 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1278671096| ~z$r_buff1_thd4~0_In1278671096) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite14_Out1278671096| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1278671096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1278671096, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1278671096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1278671096} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1278671096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1278671096, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1278671096|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1278671096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1278671096} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:37:17,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:37:17,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:37:17,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In843892299 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In843892299 256)))) (or (and (= ~z$w_buff0_used~0_In843892299 |P2Thread1of1ForFork2_#t~ite5_Out843892299|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out843892299| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In843892299, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In843892299} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out843892299|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843892299, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In843892299} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:37:17,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-53732710 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-53732710 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-53732710 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-53732710 256) 0))) (or (and (= ~z$w_buff1_used~0_In-53732710 |P2Thread1of1ForFork2_#t~ite6_Out-53732710|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-53732710| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-53732710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-53732710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-53732710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-53732710} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-53732710|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-53732710, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-53732710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-53732710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-53732710} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:37:17,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1177774726 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1177774726 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1177774726| ~z$r_buff0_thd3~0_In1177774726) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1177774726|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1177774726, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1177774726} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1177774726, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1177774726, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1177774726|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:37:17,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-507054571 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-507054571 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-507054571 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-507054571 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-507054571 |P2Thread1of1ForFork2_#t~ite8_Out-507054571|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-507054571|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-507054571, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-507054571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507054571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-507054571} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-507054571, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-507054571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507054571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-507054571, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-507054571|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:37:17,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:37:17,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 06:37:17,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In840173332 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In840173332 256)))) (or (and (= ~z~0_In840173332 |ULTIMATE.start_main_#t~ite19_Out840173332|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In840173332 |ULTIMATE.start_main_#t~ite19_Out840173332|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In840173332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840173332, ~z$w_buff1~0=~z$w_buff1~0_In840173332, ~z~0=~z~0_In840173332} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out840173332|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In840173332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840173332, ~z$w_buff1~0=~z$w_buff1~0_In840173332, ~z~0=~z~0_In840173332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:37:17,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:37:17,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1037107622 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1037107622 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1037107622| ~z$w_buff0_used~0_In-1037107622) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1037107622| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1037107622, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1037107622} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1037107622, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1037107622, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1037107622|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:37:17,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In609108341 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In609108341 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In609108341 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In609108341 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In609108341 |ULTIMATE.start_main_#t~ite22_Out609108341|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out609108341|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In609108341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In609108341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In609108341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609108341} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In609108341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In609108341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In609108341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609108341, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out609108341|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:37:17,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1044966980 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1044966980 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1044966980 |ULTIMATE.start_main_#t~ite23_Out-1044966980|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1044966980|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044966980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044966980} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1044966980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044966980, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1044966980|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:37:17,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1265213641 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1265213641 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1265213641 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1265213641 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1265213641| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out1265213641| ~z$r_buff1_thd0~0_In1265213641) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1265213641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265213641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1265213641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265213641} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1265213641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265213641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1265213641, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1265213641|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265213641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:37:17,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1891029073 256)))) (or (and (= ~z$w_buff1_used~0_In1891029073 |ULTIMATE.start_main_#t~ite40_Out1891029073|) (= |ULTIMATE.start_main_#t~ite39_In1891029073| |ULTIMATE.start_main_#t~ite39_Out1891029073|) (not .cse0)) (and (= ~z$w_buff1_used~0_In1891029073 |ULTIMATE.start_main_#t~ite39_Out1891029073|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1891029073 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1891029073 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1891029073 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1891029073 256)))) (= |ULTIMATE.start_main_#t~ite40_Out1891029073| |ULTIMATE.start_main_#t~ite39_Out1891029073|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1891029073, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1891029073, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1891029073|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1891029073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1891029073, ~weak$$choice2~0=~weak$$choice2~0_In1891029073} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1891029073, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1891029073|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1891029073|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1891029073, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1891029073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1891029073, ~weak$$choice2~0=~weak$$choice2~0_In1891029073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:37:17,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:37:17,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-38380535 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out-38380535| |ULTIMATE.start_main_#t~ite45_Out-38380535|)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In-38380535 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-38380535 256))) (.cse0 (= (mod ~weak$$choice2~0_In-38380535 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-38380535 256)))) (or (and (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-38380535| |ULTIMATE.start_main_#t~ite45_In-38380535|) (= |ULTIMATE.start_main_#t~ite46_Out-38380535| ~z$r_buff1_thd0~0_In-38380535)) (and (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) (= |ULTIMATE.start_main_#t~ite45_Out-38380535| ~z$r_buff1_thd0~0_In-38380535) .cse5 .cse0)) (= |ULTIMATE.start_main_#t~ite44_In-38380535| |ULTIMATE.start_main_#t~ite44_Out-38380535|)) (let ((.cse6 (not .cse2))) (and (or (not .cse3) .cse6) (= |ULTIMATE.start_main_#t~ite45_Out-38380535| |ULTIMATE.start_main_#t~ite44_Out-38380535|) .cse5 (not .cse4) (or (not .cse1) .cse6) .cse0 (= |ULTIMATE.start_main_#t~ite44_Out-38380535| 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38380535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38380535, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-38380535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-38380535, ~weak$$choice2~0=~weak$$choice2~0_In-38380535, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-38380535|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-38380535|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38380535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38380535, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-38380535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-38380535, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-38380535|, ~weak$$choice2~0=~weak$$choice2~0_In-38380535, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-38380535|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-38380535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:37:17,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:37:17,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:37:17,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:37:17 BasicIcfg [2019-12-27 06:37:17,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:37:17,142 INFO L168 Benchmark]: Toolchain (without parser) took 27270.71 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 99.8 MB in the beginning and 760.6 MB in the end (delta: -660.7 MB). Peak memory consumption was 707.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,143 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 153.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,144 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,145 INFO L168 Benchmark]: RCFGBuilder took 828.88 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,146 INFO L168 Benchmark]: TraceAbstraction took 25506.28 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 97.6 MB in the beginning and 760.6 MB in the end (delta: -662.9 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:37:17,149 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.61 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 153.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.88 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25506.28 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 97.6 MB in the beginning and 760.6 MB in the end (delta: -662.9 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L835] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L837] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L839] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 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) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2032 SDtfs, 2119 SDslu, 5059 SDs, 0 SdLazy, 2251 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 37 SyntacticMatches, 14 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 10996 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 789 ConstructedInterpolants, 0 QuantifiedInterpolants, 163097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...