/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:33:02,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:33:02,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:33:02,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:33:02,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:33:02,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:33:02,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:33:02,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:33:02,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:33:02,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:33:02,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:33:02,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:33:02,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:33:02,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:33:02,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:33:02,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:33:02,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:33:02,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:33:02,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:33:02,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:33:02,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:33:02,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:33:02,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:33:02,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:33:02,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:33:02,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:33:02,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:33:02,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:33:02,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:33:02,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:33:02,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:33:02,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:33:02,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:33:02,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:33:02,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:33:02,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:33:02,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:33:02,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:33:02,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:33:02,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:33:02,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:33:02,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:33:02,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:33:02,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:33:02,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:33:02,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:33:02,639 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:33:02,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:33:02,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:33:02,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:33:02,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:33:02,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:33:02,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:33:02,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:33:02,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:33:02,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:33:02,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:33:02,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:33:02,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:33:02,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:33:02,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:33:02,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:33:02,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:33:02,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:33:02,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:33:02,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:33:02,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:33:02,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:33:02,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:33:02,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:33:02,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:33:02,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:33:02,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 13:33:02,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe71bd16/589eb44a7bd34fecb000d6661a126481/FLAG9a40ce90b [2019-12-18 13:33:03,543 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:33:03,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 13:33:03,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe71bd16/589eb44a7bd34fecb000d6661a126481/FLAG9a40ce90b [2019-12-18 13:33:03,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe71bd16/589eb44a7bd34fecb000d6661a126481 [2019-12-18 13:33:03,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:33:03,845 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:33:03,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:33:03,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:33:03,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:33:03,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:03" (1/1) ... [2019-12-18 13:33:03,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba75bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:03, skipping insertion in model container [2019-12-18 13:33:03,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:03" (1/1) ... [2019-12-18 13:33:03,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:33:03,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:33:04,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:33:04,570 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:33:04,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:33:04,717 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:33:04,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04 WrapperNode [2019-12-18 13:33:04,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:33:04,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:33:04,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:33:04,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:33:04,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:33:04,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:33:04,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:33:04,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:33:04,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... [2019-12-18 13:33:04,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:33:04,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:33:04,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:33:04,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:33:04,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:33:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:33:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:33:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:33:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:33:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:33:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:33:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:33:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:33:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:33:04,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:33:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:33:04,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:33:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:33:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:33:04,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:33:04,914 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:33:05,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:33:05,677 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:33:05,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:05 BoogieIcfgContainer [2019-12-18 13:33:05,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:33:05,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:33:05,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:33:05,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:33:05,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:33:03" (1/3) ... [2019-12-18 13:33:05,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec83d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:05, skipping insertion in model container [2019-12-18 13:33:05,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:04" (2/3) ... [2019-12-18 13:33:05,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec83d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:05, skipping insertion in model container [2019-12-18 13:33:05,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:05" (3/3) ... [2019-12-18 13:33:05,687 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-18 13:33:05,698 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:33:05,699 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:33:05,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:33:05,710 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:33:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,749 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,750 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,750 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,752 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,759 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,760 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,760 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,806 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,806 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,808 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:05,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:33:05,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:33:05,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:33:05,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:33:05,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:33:05,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:33:05,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:33:05,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:33:05,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:33:05,863 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 13:33:05,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 13:33:05,971 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 13:33:05,972 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:33:05,994 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:33:06,014 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 13:33:06,081 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 13:33:06,081 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:33:06,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:33:06,103 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:33:06,104 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:33:09,495 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-18 13:33:11,608 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 13:33:11,781 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 13:33:11,802 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 13:33:11,802 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 13:33:11,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 13:33:13,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 13:33:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 13:33:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:33:13,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:13,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:13,929 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-18 13:33:13,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 13:33:13,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:13,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504903323] [2019-12-18 13:33:13,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:14,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504903323] [2019-12-18 13:33:14,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:14,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:33:14,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763270857] [2019-12-18 13:33:14,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:14,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:14,280 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 13:33:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:15,590 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 13:33:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:15,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:33:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:16,023 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 13:33:16,024 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 13:33:16,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 13:33:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 13:33:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 13:33:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 13:33:18,099 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 13:33:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:18,100 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 13:33:18,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 13:33:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:33:18,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:18,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:18,107 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-18 13:33:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 13:33:18,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:18,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065059466] [2019-12-18 13:33:18,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:18,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065059466] [2019-12-18 13:33:18,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:18,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:18,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687406915] [2019-12-18 13:33:18,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:33:18,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:33:18,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:33:18,213 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 13:33:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:20,550 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 13:33:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:33:20,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:33:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:20,791 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 13:33:20,791 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 13:33:20,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:33:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 13:33:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 13:33:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 13:33:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 13:33:22,447 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 13:33:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:22,447 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 13:33:22,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:33:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 13:33:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:33:22,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:22,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:22,450 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-18 13:33:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 13:33:22,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:22,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517382205] [2019-12-18 13:33:22,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:22,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517382205] [2019-12-18 13:33:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:22,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783615029] [2019-12-18 13:33:22,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:33:22,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:33:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:33:22,908 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 13:33:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:23,450 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 13:33:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:33:23,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:33:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:23,868 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 13:33:23,868 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 13:33:23,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:33:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 13:33:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 13:33:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 13:33:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 13:33:27,804 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 13:33:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:27,805 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 13:33:27,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:33:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 13:33:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:33:27,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:27,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:27,820 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-18 13:33:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 13:33:27,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:27,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684129504] [2019-12-18 13:33:27,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:27,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684129504] [2019-12-18 13:33:27,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:27,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:27,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475806398] [2019-12-18 13:33:27,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:33:27,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:33:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:33:27,911 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 13:33:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:29,136 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 13:33:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:33:29,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 13:33:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:29,329 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 13:33:29,329 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 13:33:29,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:33:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 13:33:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 13:33:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 13:33:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 13:33:33,103 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 13:33:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:33,103 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 13:33:33,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:33:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 13:33:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:33:33,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:33,161 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-18 13:33:33,161 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-18 13:33:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 13:33:33,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:33,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324855566] [2019-12-18 13:33:33,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:33,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324855566] [2019-12-18 13:33:33,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:33,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:33,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414123852] [2019-12-18 13:33:33,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:33,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:33,216 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 13:33:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:33,992 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 13:33:33,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:33,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 13:33:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:34,156 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 13:33:34,156 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 13:33:34,156 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-18 13:33:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 13:33:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 13:33:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 13:33:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 13:33:37,896 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 13:33:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:37,896 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 13:33:37,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 13:33:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:33:37,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:37,931 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-18 13:33:37,931 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-18 13:33:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 13:33:37,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:37,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095218833] [2019-12-18 13:33:37,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:38,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095218833] [2019-12-18 13:33:38,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:33:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986543090] [2019-12-18 13:33:38,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:33:38,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:33:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:33:38,032 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 13:33:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:39,319 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 13:33:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:33:39,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:33:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:39,551 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 13:33:39,552 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 13:33:39,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:33:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 13:33:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 13:33:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 13:33:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 13:33:44,103 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 13:33:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:44,104 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 13:33:44,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:33:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 13:33:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:33:44,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:44,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:44,173 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-18 13:33:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 13:33:44,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:44,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873778313] [2019-12-18 13:33:44,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:44,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873778313] [2019-12-18 13:33:44,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:44,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:44,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398650746] [2019-12-18 13:33:44,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:44,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:44,262 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 13:33:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:44,597 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 13:33:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:44,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 13:33:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:44,755 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 13:33:44,755 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 13:33:44,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 13:33:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 13:33:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 13:33:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 13:33:46,577 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 13:33:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:46,578 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 13:33:46,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 13:33:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:33:46,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:46,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:46,635 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-18 13:33:46,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 13:33:46,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:46,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108785101] [2019-12-18 13:33:46,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:46,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108785101] [2019-12-18 13:33:46,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:46,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:33:46,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236598758] [2019-12-18 13:33:46,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:33:46,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:46,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:33:46,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:33:46,852 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-18 13:33:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:49,328 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 13:33:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:33:49,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-18 13:33:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:49,668 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 13:33:49,668 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 13:33:49,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:33:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 13:33:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 13:33:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 13:33:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 13:33:54,292 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 13:33:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 13:33:54,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:33:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 13:33:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:33:54,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:54,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:54,359 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-18 13:33:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 13:33:54,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:54,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269356004] [2019-12-18 13:33:54,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:54,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269356004] [2019-12-18 13:33:54,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:54,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:33:54,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064490596] [2019-12-18 13:33:54,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:33:54,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:33:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:33:54,498 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-18 13:33:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:55,065 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-18 13:33:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:33:55,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 13:33:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:55,246 INFO L225 Difference]: With dead ends: 74494 [2019-12-18 13:33:55,246 INFO L226 Difference]: Without dead ends: 71114 [2019-12-18 13:33:55,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:33:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-18 13:33:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-18 13:33:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-18 13:33:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-18 13:33:57,310 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-18 13:33:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:57,310 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-18 13:33:57,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:33:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-18 13:33:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:33:57,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:57,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:57,377 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-18 13:33:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-18 13:33:57,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:57,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884431414] [2019-12-18 13:33:57,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:33:58,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884431414] [2019-12-18 13:33:58,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:58,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:33:58,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758369391] [2019-12-18 13:33:58,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:33:58,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:33:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:33:58,403 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 10 states. [2019-12-18 13:33:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:59,706 INFO L93 Difference]: Finished difference Result 116392 states and 484250 transitions. [2019-12-18 13:33:59,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:33:59,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 13:33:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:59,977 INFO L225 Difference]: With dead ends: 116392 [2019-12-18 13:33:59,977 INFO L226 Difference]: Without dead ends: 98004 [2019-12-18 13:33:59,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:34:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98004 states. [2019-12-18 13:34:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98004 to 86086. [2019-12-18 13:34:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-12-18 13:34:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 356572 transitions. [2019-12-18 13:34:05,542 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 356572 transitions. Word has length 37 [2019-12-18 13:34:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:05,542 INFO L462 AbstractCegarLoop]: Abstraction has 86086 states and 356572 transitions. [2019-12-18 13:34:05,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:34:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 356572 transitions. [2019-12-18 13:34:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 13:34:05,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:05,656 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] [2019-12-18 13:34:05,656 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-18 13:34:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash 438975875, now seen corresponding path program 1 times [2019-12-18 13:34:05,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:05,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072287771] [2019-12-18 13:34:05,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:05,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072287771] [2019-12-18 13:34:05,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:05,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:34:05,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912583081] [2019-12-18 13:34:05,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:34:05,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:05,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:34:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:34:05,944 INFO L87 Difference]: Start difference. First operand 86086 states and 356572 transitions. Second operand 8 states. [2019-12-18 13:34:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:07,698 INFO L93 Difference]: Finished difference Result 124478 states and 511412 transitions. [2019-12-18 13:34:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:34:07,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-18 13:34:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:08,033 INFO L225 Difference]: With dead ends: 124478 [2019-12-18 13:34:08,033 INFO L226 Difference]: Without dead ends: 123998 [2019-12-18 13:34:08,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123998 states. [2019-12-18 13:34:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123998 to 107150. [2019-12-18 13:34:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107150 states. [2019-12-18 13:34:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107150 states to 107150 states and 443016 transitions. [2019-12-18 13:34:11,313 INFO L78 Accepts]: Start accepts. Automaton has 107150 states and 443016 transitions. Word has length 38 [2019-12-18 13:34:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:11,313 INFO L462 AbstractCegarLoop]: Abstraction has 107150 states and 443016 transitions. [2019-12-18 13:34:11,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:34:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 107150 states and 443016 transitions. [2019-12-18 13:34:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 13:34:11,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:11,460 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] [2019-12-18 13:34:11,460 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-18 13:34:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash 322595139, now seen corresponding path program 2 times [2019-12-18 13:34:11,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:11,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288127341] [2019-12-18 13:34:11,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:12,662 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-12-18 13:34:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:12,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288127341] [2019-12-18 13:34:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:12,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:34:12,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638755786] [2019-12-18 13:34:12,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:34:12,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:34:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:12,942 INFO L87 Difference]: Start difference. First operand 107150 states and 443016 transitions. Second operand 11 states. [2019-12-18 13:34:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:14,975 INFO L93 Difference]: Finished difference Result 168490 states and 703756 transitions. [2019-12-18 13:34:14,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:34:14,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-18 13:34:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:15,406 INFO L225 Difference]: With dead ends: 168490 [2019-12-18 13:34:15,407 INFO L226 Difference]: Without dead ends: 146330 [2019-12-18 13:34:15,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:34:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146330 states. [2019-12-18 13:34:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146330 to 100430. [2019-12-18 13:34:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100430 states. [2019-12-18 13:34:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100430 states to 100430 states and 414816 transitions. [2019-12-18 13:34:23,508 INFO L78 Accepts]: Start accepts. Automaton has 100430 states and 414816 transitions. Word has length 38 [2019-12-18 13:34:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:23,508 INFO L462 AbstractCegarLoop]: Abstraction has 100430 states and 414816 transitions. [2019-12-18 13:34:23,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:34:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 100430 states and 414816 transitions. [2019-12-18 13:34:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:34:23,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:23,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:23,659 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-18 13:34:23,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash 922127842, now seen corresponding path program 1 times [2019-12-18 13:34:23,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:23,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734053521] [2019-12-18 13:34:23,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:23,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734053521] [2019-12-18 13:34:23,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:23,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:34:23,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908483689] [2019-12-18 13:34:23,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:34:23,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:34:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:34:23,729 INFO L87 Difference]: Start difference. First operand 100430 states and 414816 transitions. Second operand 4 states. [2019-12-18 13:34:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:24,149 INFO L93 Difference]: Finished difference Result 78877 states and 299740 transitions. [2019-12-18 13:34:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:34:24,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 13:34:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:25,237 INFO L225 Difference]: With dead ends: 78877 [2019-12-18 13:34:25,237 INFO L226 Difference]: Without dead ends: 77705 [2019-12-18 13:34:25,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:34:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77705 states. [2019-12-18 13:34:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77705 to 77705. [2019-12-18 13:34:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77705 states. [2019-12-18 13:34:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77705 states to 77705 states and 296048 transitions. [2019-12-18 13:34:31,245 INFO L78 Accepts]: Start accepts. Automaton has 77705 states and 296048 transitions. Word has length 39 [2019-12-18 13:34:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:31,245 INFO L462 AbstractCegarLoop]: Abstraction has 77705 states and 296048 transitions. [2019-12-18 13:34:31,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:34:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 77705 states and 296048 transitions. [2019-12-18 13:34:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:34:31,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:31,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:31,347 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-18 13:34:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1151366660, now seen corresponding path program 1 times [2019-12-18 13:34:31,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:31,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554625989] [2019-12-18 13:34:31,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:31,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554625989] [2019-12-18 13:34:31,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:31,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:34:31,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886332434] [2019-12-18 13:34:31,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:34:31,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:34:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:34:31,426 INFO L87 Difference]: Start difference. First operand 77705 states and 296048 transitions. Second operand 5 states. [2019-12-18 13:34:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:31,568 INFO L93 Difference]: Finished difference Result 31190 states and 98377 transitions. [2019-12-18 13:34:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:34:31,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:34:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:31,614 INFO L225 Difference]: With dead ends: 31190 [2019-12-18 13:34:31,614 INFO L226 Difference]: Without dead ends: 30266 [2019-12-18 13:34:31,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30266 states. [2019-12-18 13:34:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30266 to 30266. [2019-12-18 13:34:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-18 13:34:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 95413 transitions. [2019-12-18 13:34:32,077 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 95413 transitions. Word has length 40 [2019-12-18 13:34:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:32,077 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 95413 transitions. [2019-12-18 13:34:32,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:34:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 95413 transitions. [2019-12-18 13:34:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:34:32,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:32,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:32,103 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-18 13:34:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1993576609, now seen corresponding path program 1 times [2019-12-18 13:34:32,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:32,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061782484] [2019-12-18 13:34:32,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:32,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061782484] [2019-12-18 13:34:32,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:32,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:34:32,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834353904] [2019-12-18 13:34:32,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:32,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:32,210 INFO L87 Difference]: Start difference. First operand 30266 states and 95413 transitions. Second operand 7 states. [2019-12-18 13:34:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:32,565 INFO L93 Difference]: Finished difference Result 50135 states and 158375 transitions. [2019-12-18 13:34:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:34:32,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 13:34:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:32,612 INFO L225 Difference]: With dead ends: 50135 [2019-12-18 13:34:32,613 INFO L226 Difference]: Without dead ends: 22346 [2019-12-18 13:34:32,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22346 states. [2019-12-18 13:34:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22346 to 19681. [2019-12-18 13:34:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-18 13:34:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 61956 transitions. [2019-12-18 13:34:33,301 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 61956 transitions. Word has length 41 [2019-12-18 13:34:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:33,301 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 61956 transitions. [2019-12-18 13:34:33,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 61956 transitions. [2019-12-18 13:34:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:34:33,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:33,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:33,316 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-18 13:34:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 2 times [2019-12-18 13:34:33,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:33,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071242541] [2019-12-18 13:34:33,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:33,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071242541] [2019-12-18 13:34:33,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:33,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:34:33,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386220993] [2019-12-18 13:34:33,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:34:33,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:34:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:34:33,389 INFO L87 Difference]: Start difference. First operand 19681 states and 61956 transitions. Second operand 6 states. [2019-12-18 13:34:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:33,465 INFO L93 Difference]: Finished difference Result 3554 states and 8942 transitions. [2019-12-18 13:34:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:34:33,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 13:34:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:33,468 INFO L225 Difference]: With dead ends: 3554 [2019-12-18 13:34:33,468 INFO L226 Difference]: Without dead ends: 3209 [2019-12-18 13:34:33,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:34:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-12-18 13:34:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3149. [2019-12-18 13:34:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2019-12-18 13:34:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 7786 transitions. [2019-12-18 13:34:33,500 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 7786 transitions. Word has length 41 [2019-12-18 13:34:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:33,501 INFO L462 AbstractCegarLoop]: Abstraction has 3149 states and 7786 transitions. [2019-12-18 13:34:33,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:34:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 7786 transitions. [2019-12-18 13:34:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:34:33,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:33,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:33,503 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-18 13:34:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-18 13:34:33,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:33,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638978451] [2019-12-18 13:34:33,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:33,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638978451] [2019-12-18 13:34:33,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:33,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:34:33,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496626912] [2019-12-18 13:34:33,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:33,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:33,591 INFO L87 Difference]: Start difference. First operand 3149 states and 7786 transitions. Second operand 7 states. [2019-12-18 13:34:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:33,682 INFO L93 Difference]: Finished difference Result 1215 states and 3316 transitions. [2019-12-18 13:34:33,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:34:33,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 13:34:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:33,684 INFO L225 Difference]: With dead ends: 1215 [2019-12-18 13:34:33,684 INFO L226 Difference]: Without dead ends: 1169 [2019-12-18 13:34:33,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-12-18 13:34:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1057. [2019-12-18 13:34:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-12-18 13:34:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2906 transitions. [2019-12-18 13:34:33,697 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2906 transitions. Word has length 48 [2019-12-18 13:34:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:33,697 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 2906 transitions. [2019-12-18 13:34:33,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2906 transitions. [2019-12-18 13:34:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:34:33,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:33,699 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-18 13:34:33,699 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-18 13:34:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-18 13:34:33,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:33,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109009599] [2019-12-18 13:34:33,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:33,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109009599] [2019-12-18 13:34:33,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:33,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:34:33,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631024730] [2019-12-18 13:34:33,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:34:33,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:34:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:34:33,759 INFO L87 Difference]: Start difference. First operand 1057 states and 2906 transitions. Second operand 3 states. [2019-12-18 13:34:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:33,777 INFO L93 Difference]: Finished difference Result 1011 states and 2723 transitions. [2019-12-18 13:34:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:34:33,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:34:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:33,779 INFO L225 Difference]: With dead ends: 1011 [2019-12-18 13:34:33,779 INFO L226 Difference]: Without dead ends: 1011 [2019-12-18 13:34:33,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:34:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-18 13:34:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2019-12-18 13:34:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-12-18 13:34:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2723 transitions. [2019-12-18 13:34:33,797 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2723 transitions. Word has length 59 [2019-12-18 13:34:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:33,797 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 2723 transitions. [2019-12-18 13:34:33,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:34:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2723 transitions. [2019-12-18 13:34:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:33,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:33,799 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-18 13:34:33,799 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-18 13:34:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 1 times [2019-12-18 13:34:33,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:33,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158111690] [2019-12-18 13:34:33,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:34,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158111690] [2019-12-18 13:34:34,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:34,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:34:34,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399718706] [2019-12-18 13:34:34,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:34:34,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:34:34,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:34:34,023 INFO L87 Difference]: Start difference. First operand 1011 states and 2723 transitions. Second operand 13 states. [2019-12-18 13:34:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:35,000 INFO L93 Difference]: Finished difference Result 1849 states and 4773 transitions. [2019-12-18 13:34:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:34:35,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:34:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:35,004 INFO L225 Difference]: With dead ends: 1849 [2019-12-18 13:34:35,004 INFO L226 Difference]: Without dead ends: 1441 [2019-12-18 13:34:35,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:34:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2019-12-18 13:34:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1041. [2019-12-18 13:34:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-12-18 13:34:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2802 transitions. [2019-12-18 13:34:35,019 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 2802 transitions. Word has length 60 [2019-12-18 13:34:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:35,019 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 2802 transitions. [2019-12-18 13:34:35,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:34:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 2802 transitions. [2019-12-18 13:34:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:35,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:35,020 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-18 13:34:35,020 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:34:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash -908704936, now seen corresponding path program 2 times [2019-12-18 13:34:35,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:35,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662040096] [2019-12-18 13:34:35,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:35,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662040096] [2019-12-18 13:34:35,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:35,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:34:35,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848990600] [2019-12-18 13:34:35,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:34:35,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:34:35,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:34:35,100 INFO L87 Difference]: Start difference. First operand 1041 states and 2802 transitions. Second operand 6 states. [2019-12-18 13:34:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:35,168 INFO L93 Difference]: Finished difference Result 1551 states and 3905 transitions. [2019-12-18 13:34:35,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:34:35,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:34:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:35,170 INFO L225 Difference]: With dead ends: 1551 [2019-12-18 13:34:35,170 INFO L226 Difference]: Without dead ends: 577 [2019-12-18 13:34:35,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:34:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-18 13:34:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2019-12-18 13:34:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-18 13:34:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1240 transitions. [2019-12-18 13:34:35,179 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1240 transitions. Word has length 60 [2019-12-18 13:34:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:35,179 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1240 transitions. [2019-12-18 13:34:35,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:34:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1240 transitions. [2019-12-18 13:34:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:35,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:35,181 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-18 13:34:35,181 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:34:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 3 times [2019-12-18 13:34:35,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:35,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265804219] [2019-12-18 13:34:35,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:35,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265804219] [2019-12-18 13:34:35,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:35,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:34:35,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661233585] [2019-12-18 13:34:35,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:34:35,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:34:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:34:35,501 INFO L87 Difference]: Start difference. First operand 571 states and 1240 transitions. Second operand 12 states. [2019-12-18 13:34:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:35,973 INFO L93 Difference]: Finished difference Result 883 states and 1912 transitions. [2019-12-18 13:34:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:34:35,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:34:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:35,974 INFO L225 Difference]: With dead ends: 883 [2019-12-18 13:34:35,975 INFO L226 Difference]: Without dead ends: 595 [2019-12-18 13:34:35,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:34:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-18 13:34:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 539. [2019-12-18 13:34:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-18 13:34:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1158 transitions. [2019-12-18 13:34:35,982 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1158 transitions. Word has length 60 [2019-12-18 13:34:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:35,982 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1158 transitions. [2019-12-18 13:34:35,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:34:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1158 transitions. [2019-12-18 13:34:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:35,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:35,983 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-18 13:34:35,983 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:34:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 4 times [2019-12-18 13:34:35,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:35,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511590874] [2019-12-18 13:34:35,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:34:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:34:36,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:34:36,105 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:34:36,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= 0 v_~z$r_buff1_thd4~0_193) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~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, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~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, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~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_~#t1150~0.base, 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, ~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_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~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_~#t1151~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-18 13:34:36,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-18 13:34:36,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:34:36,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-18 13:34:36,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~__unbuffered_p3_EBX~0_Out-1823876873 ~b~0_In-1823876873) (= ~z$r_buff0_thd4~0_Out-1823876873 1) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1823876873)) (= ~z$r_buff0_thd3~0_In-1823876873 ~z$r_buff1_thd3~0_Out-1823876873) (= ~z$r_buff1_thd1~0_Out-1823876873 ~z$r_buff0_thd1~0_In-1823876873) (= ~z$r_buff0_thd2~0_In-1823876873 ~z$r_buff1_thd2~0_Out-1823876873) (= ~a~0_Out-1823876873 1) (= ~z$r_buff0_thd0~0_In-1823876873 ~z$r_buff1_thd0~0_Out-1823876873) (= ~z$r_buff1_thd4~0_Out-1823876873 ~z$r_buff0_thd4~0_In-1823876873) (= ~a~0_Out-1823876873 ~__unbuffered_p3_EAX~0_Out-1823876873)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1823876873, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1823876873, ~b~0=~b~0_In-1823876873, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1823876873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1823876873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1823876873, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1823876873} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1823876873, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1823876873, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1823876873, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1823876873, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1823876873, ~a~0=~a~0_Out-1823876873, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1823876873, ~b~0=~b~0_In-1823876873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1823876873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1823876873, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1823876873, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1823876873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1823876873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1823876873, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1823876873} 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-18 13:34:36,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} 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-18 13:34:36,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:34:36,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-275489209 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-275489209 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-275489209| ~z$w_buff0_used~0_In-275489209) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-275489209|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-275489209, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-275489209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-275489209, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-275489209, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-275489209|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:34:36,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1730811984 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1730811984 256)))) (or (and (= ~z~0_In1730811984 |P2Thread1of1ForFork2_#t~ite3_Out1730811984|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In1730811984 |P2Thread1of1ForFork2_#t~ite3_Out1730811984|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1730811984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1730811984, ~z$w_buff1~0=~z$w_buff1~0_In1730811984, ~z~0=~z~0_In1730811984} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1730811984|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1730811984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1730811984, ~z$w_buff1~0=~z$w_buff1~0_In1730811984, ~z~0=~z~0_In1730811984} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:34:36,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:34:36,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2141444795 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In2141444795 256) 0))) (or (and (= ~z$w_buff0_used~0_In2141444795 |P2Thread1of1ForFork2_#t~ite5_Out2141444795|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out2141444795|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141444795, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141444795} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out2141444795|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141444795, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141444795} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:34:36,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1142859457 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1142859457 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1142859457 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1142859457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out1142859457| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out1142859457| ~z$w_buff1_used~0_In1142859457) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1142859457, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1142859457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1142859457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1142859457} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1142859457|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1142859457, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1142859457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1142859457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1142859457} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:34:36,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In21115490 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In21115490 256)))) (or (and (= ~z$r_buff0_thd3~0_In21115490 |P2Thread1of1ForFork2_#t~ite7_Out21115490|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out21115490| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In21115490, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In21115490} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In21115490, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In21115490, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out21115490|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:34:36,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1616948329 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1616948329 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1616948329 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1616948329 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In1616948329 |P2Thread1of1ForFork2_#t~ite8_Out1616948329|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite8_Out1616948329| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1616948329, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1616948329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616948329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616948329} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1616948329, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1616948329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616948329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616948329, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1616948329|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:34:36,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} 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-18 13:34:36,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-516054252 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-516054252 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-516054252 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-516054252 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-516054252|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-516054252 |P3Thread1of1ForFork3_#t~ite12_Out-516054252|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-516054252, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-516054252, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-516054252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516054252} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-516054252, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-516054252, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-516054252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516054252, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-516054252|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:34:36,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1298712592 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1298712592 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1298712592 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1298712592 ~z$r_buff0_thd4~0_In1298712592)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1298712592, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1298712592} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1298712592, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1298712592, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1298712592|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:34:36,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In995360331 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In995360331 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In995360331 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In995360331 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out995360331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In995360331 |P3Thread1of1ForFork3_#t~ite14_Out995360331|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In995360331, ~z$w_buff0_used~0=~z$w_buff0_used~0_In995360331, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In995360331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In995360331} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In995360331, ~z$w_buff0_used~0=~z$w_buff0_used~0_In995360331, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out995360331|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In995360331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In995360331} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:34:36,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, 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-18 13:34:36,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:34:36,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2101485715 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite20_Out2101485715| |ULTIMATE.start_main_#t~ite19_Out2101485715|)) (.cse2 (= (mod ~z$w_buff1_used~0_In2101485715 256) 0))) (or (and (= ~z~0_In2101485715 |ULTIMATE.start_main_#t~ite19_Out2101485715|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2101485715| ~z$w_buff1~0_In2101485715) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2101485715, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101485715, ~z$w_buff1~0=~z$w_buff1~0_In2101485715, ~z~0=~z~0_In2101485715} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2101485715|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2101485715, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101485715, ~z$w_buff1~0=~z$w_buff1~0_In2101485715, ~z~0=~z~0_In2101485715, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2101485715|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:34:36,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1885571345 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1885571345 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1885571345| ~z$w_buff0_used~0_In1885571345) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1885571345|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1885571345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885571345} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1885571345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885571345, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1885571345|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:34:36,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1085240157 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1085240157 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1085240157 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1085240157 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1085240157|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1085240157 |ULTIMATE.start_main_#t~ite22_Out-1085240157|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1085240157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1085240157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1085240157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1085240157} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1085240157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1085240157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1085240157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1085240157, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1085240157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:34:36,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1855553747 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1855553747 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out1855553747| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out1855553747| ~z$r_buff0_thd0~0_In1855553747)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1855553747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1855553747} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1855553747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1855553747, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1855553747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:34:36,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1875219949 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1875219949 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1875219949 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1875219949 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1875219949|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1875219949 |ULTIMATE.start_main_#t~ite24_Out-1875219949|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1875219949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875219949, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1875219949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1875219949} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1875219949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875219949, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1875219949, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1875219949|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1875219949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:34:36,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In27461679 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In27461679 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In27461679 256)) .cse0) (= (mod ~z$w_buff0_used~0_In27461679 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In27461679 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite37_Out27461679| |ULTIMATE.start_main_#t~ite36_Out27461679|) (= |ULTIMATE.start_main_#t~ite36_Out27461679| ~z$w_buff0_used~0_In27461679)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_In27461679| |ULTIMATE.start_main_#t~ite36_Out27461679|) (= |ULTIMATE.start_main_#t~ite37_Out27461679| ~z$w_buff0_used~0_In27461679)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In27461679, ~z$w_buff0_used~0=~z$w_buff0_used~0_In27461679, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In27461679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In27461679, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In27461679|, ~weak$$choice2~0=~weak$$choice2~0_In27461679} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In27461679, ~z$w_buff0_used~0=~z$w_buff0_used~0_In27461679, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In27461679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In27461679, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out27461679|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out27461679|, ~weak$$choice2~0=~weak$$choice2~0_In27461679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:34:36,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In259454266 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out259454266| |ULTIMATE.start_main_#t~ite40_Out259454266|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In259454266 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In259454266 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In259454266 256))) (= 0 (mod ~z$w_buff0_used~0_In259454266 256)))) (= ~z$w_buff1_used~0_In259454266 |ULTIMATE.start_main_#t~ite39_Out259454266|)) (and (= |ULTIMATE.start_main_#t~ite39_In259454266| |ULTIMATE.start_main_#t~ite39_Out259454266|) (= ~z$w_buff1_used~0_In259454266 |ULTIMATE.start_main_#t~ite40_Out259454266|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In259454266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In259454266, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In259454266|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In259454266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259454266, ~weak$$choice2~0=~weak$$choice2~0_In259454266} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In259454266, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out259454266|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out259454266|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In259454266, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In259454266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259454266, ~weak$$choice2~0=~weak$$choice2~0_In259454266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:34:36,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} 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-18 13:34:36,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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-18 13:34:36,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:34:36,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:34:36 BasicIcfg [2019-12-18 13:34:36,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:34:36,266 INFO L168 Benchmark]: Toolchain (without parser) took 92422.52 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,269 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:34:36,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.70 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 155.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,271 INFO L168 Benchmark]: Boogie Preprocessor took 49.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,271 INFO L168 Benchmark]: RCFGBuilder took 836.69 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 100.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,272 INFO L168 Benchmark]: TraceAbstraction took 90583.25 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:34:36,279 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.26 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 872.70 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 155.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.69 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 100.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90583.25 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L837] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] 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_p1_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] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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] [L812] 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) [L776] 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_p1_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=1, 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] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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] 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_p1_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=1, 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 = !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) [L859] 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_p1_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=1, 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 = 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)) [L860] 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_p1_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=1, 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] [L860] 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)) [L861] 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)) [L862] 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)) [L864] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, 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] [L864] 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)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_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_p1_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=1, 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, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3148 SDtfs, 4408 SDslu, 9517 SDs, 0 SdLazy, 4890 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 24 SyntacticMatches, 16 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107150occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 165133 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 844 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 177664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...