/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:49:17,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:49:17,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:49:17,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:49:17,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:49:17,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:49:17,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:49:17,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:49:17,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:49:17,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:49:17,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:49:17,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:49:17,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:49:17,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:49:17,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:49:17,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:49:17,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:49:17,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:49:17,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:49:17,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:49:17,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:49:17,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:49:17,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:49:17,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:49:17,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:49:17,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:49:17,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:49:17,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:49:17,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:49:17,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:49:17,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:49:17,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:49:17,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:49:17,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:49:17,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:49:17,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:49:17,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:49:17,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:49:17,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:49:17,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:49:17,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:49:17,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:49:17,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:49:17,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:49:17,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:49:17,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:49:17,858 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:49:17,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:49:17,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:49:17,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:49:17,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:49:17,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:49:17,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:49:17,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:49:17,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:49:17,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:49:17,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:49:17,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:49:17,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:49:17,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:49:17,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:49:17,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:49:17,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:49:17,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:49:17,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:49:17,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:49:17,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:49:17,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:49:17,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:49:17,870 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:49:17,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:49:17,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:49:18,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:49:18,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:49:18,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:49:18,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:49:18,165 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:49:18,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 20:49:18,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16be3b8/99122fc1b6c6484f847cc07beccc16c0/FLAGc347718cc [2019-12-18 20:49:18,774 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:49:18,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt.i [2019-12-18 20:49:18,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16be3b8/99122fc1b6c6484f847cc07beccc16c0/FLAGc347718cc [2019-12-18 20:49:19,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16be3b8/99122fc1b6c6484f847cc07beccc16c0 [2019-12-18 20:49:19,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:49:19,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:49:19,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:49:19,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:49:19,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:49:19,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3be3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19, skipping insertion in model container [2019-12-18 20:49:19,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:49:19,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:49:19,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:49:19,602 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:49:19,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:49:19,755 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:49:19,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19 WrapperNode [2019-12-18 20:49:19,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:49:19,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:49:19,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:49:19,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:49:19,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:49:19,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:49:19,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:49:19,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:49:19,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (1/1) ... [2019-12-18 20:49:19,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:49:19,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:49:19,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:49:19,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:49:19,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (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 20:49:19,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:49:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:49:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:49:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:49:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:49:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:49:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:49:19,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:49:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:49:19,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:49:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:49:19,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:49:19,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:49:19,936 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 20:49:20,678 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:49:20,679 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:49:20,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:49:20 BoogieIcfgContainer [2019-12-18 20:49:20,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:49:20,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:49:20,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:49:20,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:49:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:49:19" (1/3) ... [2019-12-18 20:49:20,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e6fdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:49:20, skipping insertion in model container [2019-12-18 20:49:20,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:19" (2/3) ... [2019-12-18 20:49:20,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e6fdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:49:20, skipping insertion in model container [2019-12-18 20:49:20,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:49:20" (3/3) ... [2019-12-18 20:49:20,690 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt.i [2019-12-18 20:49:20,700 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:49:20,701 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:49:20,712 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:49:20,713 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:49:20,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,818 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,819 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,834 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,837 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:20,858 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:49:20,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:49:20,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:49:20,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:49:20,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:49:20,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:49:20,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:49:20,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:49:20,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:49:20,897 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 20:49:20,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 20:49:20,984 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 20:49:20,984 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:49:21,003 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:49:21,030 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 20:49:21,094 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 20:49:21,094 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:49:21,107 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:49:21,131 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:49:21,132 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:49:24,864 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:49:25,029 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:49:25,050 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68107 [2019-12-18 20:49:25,051 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 20:49:25,055 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 20:49:36,953 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 20:49:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 20:49:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:49:36,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:36,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:49:36,964 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash 799324594, now seen corresponding path program 1 times [2019-12-18 20:49:36,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:36,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992800946] [2019-12-18 20:49:36,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:37,258 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 20:49:37,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992800946] [2019-12-18 20:49:37,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:37,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:49:37,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304125536] [2019-12-18 20:49:37,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:37,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:37,287 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 20:49:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:39,737 INFO L93 Difference]: Finished difference Result 87213 states and 375136 transitions. [2019-12-18 20:49:39,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:39,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:49:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:40,326 INFO L225 Difference]: With dead ends: 87213 [2019-12-18 20:49:40,327 INFO L226 Difference]: Without dead ends: 82117 [2019-12-18 20:49:40,328 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 20:49:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82117 states. [2019-12-18 20:49:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82117 to 82117. [2019-12-18 20:49:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82117 states. [2019-12-18 20:49:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82117 states to 82117 states and 352722 transitions. [2019-12-18 20:49:49,908 INFO L78 Accepts]: Start accepts. Automaton has 82117 states and 352722 transitions. Word has length 5 [2019-12-18 20:49:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:49,909 INFO L462 AbstractCegarLoop]: Abstraction has 82117 states and 352722 transitions. [2019-12-18 20:49:49,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 82117 states and 352722 transitions. [2019-12-18 20:49:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:49:49,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:49,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:49,918 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1561636486, now seen corresponding path program 1 times [2019-12-18 20:49:49,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:49,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567646451] [2019-12-18 20:49:49,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:50,073 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 20:49:50,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567646451] [2019-12-18 20:49:50,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:50,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:50,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349286435] [2019-12-18 20:49:50,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:50,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:50,077 INFO L87 Difference]: Start difference. First operand 82117 states and 352722 transitions. Second operand 4 states. [2019-12-18 20:49:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:54,330 INFO L93 Difference]: Finished difference Result 125342 states and 514910 transitions. [2019-12-18 20:49:54,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:54,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:49:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:55,169 INFO L225 Difference]: With dead ends: 125342 [2019-12-18 20:49:55,169 INFO L226 Difference]: Without dead ends: 125251 [2019-12-18 20:49:55,170 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 20:49:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125251 states. [2019-12-18 20:50:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125251 to 113136. [2019-12-18 20:50:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113136 states. [2019-12-18 20:50:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113136 states to 113136 states and 471690 transitions. [2019-12-18 20:50:01,526 INFO L78 Accepts]: Start accepts. Automaton has 113136 states and 471690 transitions. Word has length 13 [2019-12-18 20:50:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:01,528 INFO L462 AbstractCegarLoop]: Abstraction has 113136 states and 471690 transitions. [2019-12-18 20:50:01,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 113136 states and 471690 transitions. [2019-12-18 20:50:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:50:01,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:01,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:01,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 994155576, now seen corresponding path program 1 times [2019-12-18 20:50:01,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:01,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968883394] [2019-12-18 20:50:01,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:01,653 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 20:50:01,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968883394] [2019-12-18 20:50:01,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:01,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:01,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322830092] [2019-12-18 20:50:01,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:01,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:01,656 INFO L87 Difference]: Start difference. First operand 113136 states and 471690 transitions. Second operand 4 states. [2019-12-18 20:50:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:05,316 INFO L93 Difference]: Finished difference Result 36342 states and 127270 transitions. [2019-12-18 20:50:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:05,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:50:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:05,371 INFO L225 Difference]: With dead ends: 36342 [2019-12-18 20:50:05,371 INFO L226 Difference]: Without dead ends: 28573 [2019-12-18 20:50:05,371 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 20:50:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28573 states. [2019-12-18 20:50:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28573 to 28509. [2019-12-18 20:50:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28509 states. [2019-12-18 20:50:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28509 states to 28509 states and 96204 transitions. [2019-12-18 20:50:05,969 INFO L78 Accepts]: Start accepts. Automaton has 28509 states and 96204 transitions. Word has length 13 [2019-12-18 20:50:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:05,969 INFO L462 AbstractCegarLoop]: Abstraction has 28509 states and 96204 transitions. [2019-12-18 20:50:05,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28509 states and 96204 transitions. [2019-12-18 20:50:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:05,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:05,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:05,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1804075732, now seen corresponding path program 1 times [2019-12-18 20:50:05,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:05,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329298037] [2019-12-18 20:50:05,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:06,057 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 20:50:06,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329298037] [2019-12-18 20:50:06,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:06,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:06,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075445747] [2019-12-18 20:50:06,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:06,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:06,060 INFO L87 Difference]: Start difference. First operand 28509 states and 96204 transitions. Second operand 4 states. [2019-12-18 20:50:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:06,407 INFO L93 Difference]: Finished difference Result 36737 states and 121975 transitions. [2019-12-18 20:50:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:06,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:50:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:06,469 INFO L225 Difference]: With dead ends: 36737 [2019-12-18 20:50:06,469 INFO L226 Difference]: Without dead ends: 36639 [2019-12-18 20:50:06,469 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 20:50:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36639 states. [2019-12-18 20:50:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36639 to 32064. [2019-12-18 20:50:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32064 states. [2019-12-18 20:50:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32064 states to 32064 states and 107530 transitions. [2019-12-18 20:50:07,377 INFO L78 Accepts]: Start accepts. Automaton has 32064 states and 107530 transitions. Word has length 14 [2019-12-18 20:50:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:07,377 INFO L462 AbstractCegarLoop]: Abstraction has 32064 states and 107530 transitions. [2019-12-18 20:50:07,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 32064 states and 107530 transitions. [2019-12-18 20:50:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:07,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:07,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:07,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1804212504, now seen corresponding path program 1 times [2019-12-18 20:50:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:07,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256338863] [2019-12-18 20:50:07,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:07,445 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 20:50:07,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256338863] [2019-12-18 20:50:07,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:07,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:07,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831114523] [2019-12-18 20:50:07,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:07,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:07,447 INFO L87 Difference]: Start difference. First operand 32064 states and 107530 transitions. Second operand 3 states. [2019-12-18 20:50:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:07,643 INFO L93 Difference]: Finished difference Result 47423 states and 159916 transitions. [2019-12-18 20:50:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:07,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 20:50:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:07,723 INFO L225 Difference]: With dead ends: 47423 [2019-12-18 20:50:07,723 INFO L226 Difference]: Without dead ends: 47423 [2019-12-18 20:50:07,724 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 20:50:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47423 states. [2019-12-18 20:50:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47423 to 37143. [2019-12-18 20:50:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-12-18 20:50:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 124911 transitions. [2019-12-18 20:50:08,401 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 124911 transitions. Word has length 14 [2019-12-18 20:50:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:08,402 INFO L462 AbstractCegarLoop]: Abstraction has 37143 states and 124911 transitions. [2019-12-18 20:50:08,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 124911 transitions. [2019-12-18 20:50:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:08,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:08,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:08,404 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1968777988, now seen corresponding path program 1 times [2019-12-18 20:50:08,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:08,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911286808] [2019-12-18 20:50:08,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:08,471 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 20:50:08,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911286808] [2019-12-18 20:50:08,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:08,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:08,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343571449] [2019-12-18 20:50:08,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:08,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:08,473 INFO L87 Difference]: Start difference. First operand 37143 states and 124911 transitions. Second operand 4 states. [2019-12-18 20:50:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:09,030 INFO L93 Difference]: Finished difference Result 44051 states and 146328 transitions. [2019-12-18 20:50:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:09,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:50:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:09,113 INFO L225 Difference]: With dead ends: 44051 [2019-12-18 20:50:09,114 INFO L226 Difference]: Without dead ends: 43953 [2019-12-18 20:50:09,114 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 20:50:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43953 states. [2019-12-18 20:50:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43953 to 37562. [2019-12-18 20:50:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37562 states. [2019-12-18 20:50:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37562 states to 37562 states and 126032 transitions. [2019-12-18 20:50:09,765 INFO L78 Accepts]: Start accepts. Automaton has 37562 states and 126032 transitions. Word has length 14 [2019-12-18 20:50:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:09,766 INFO L462 AbstractCegarLoop]: Abstraction has 37562 states and 126032 transitions. [2019-12-18 20:50:09,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 37562 states and 126032 transitions. [2019-12-18 20:50:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:50:09,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:09,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:09,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash 464033414, now seen corresponding path program 1 times [2019-12-18 20:50:09,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:09,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179462577] [2019-12-18 20:50:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:09,884 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 20:50:09,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179462577] [2019-12-18 20:50:09,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:09,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:09,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725617549] [2019-12-18 20:50:09,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:09,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:09,887 INFO L87 Difference]: Start difference. First operand 37562 states and 126032 transitions. Second operand 5 states. [2019-12-18 20:50:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:10,514 INFO L93 Difference]: Finished difference Result 50496 states and 166168 transitions. [2019-12-18 20:50:10,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:50:10,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:50:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:10,605 INFO L225 Difference]: With dead ends: 50496 [2019-12-18 20:50:10,606 INFO L226 Difference]: Without dead ends: 50306 [2019-12-18 20:50:10,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50306 states. [2019-12-18 20:50:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50306 to 38560. [2019-12-18 20:50:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-18 20:50:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 129178 transitions. [2019-12-18 20:50:11,689 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 129178 transitions. Word has length 22 [2019-12-18 20:50:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:11,691 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 129178 transitions. [2019-12-18 20:50:11,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 129178 transitions. [2019-12-18 20:50:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:50:11,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:11,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:11,703 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1825144588, now seen corresponding path program 1 times [2019-12-18 20:50:11,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:11,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86930505] [2019-12-18 20:50:11,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:11,798 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 20:50:11,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86930505] [2019-12-18 20:50:11,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:11,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:11,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742069027] [2019-12-18 20:50:11,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:11,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:11,800 INFO L87 Difference]: Start difference. First operand 38560 states and 129178 transitions. Second operand 5 states. [2019-12-18 20:50:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:12,424 INFO L93 Difference]: Finished difference Result 51048 states and 167840 transitions. [2019-12-18 20:50:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:50:12,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:50:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:12,518 INFO L225 Difference]: With dead ends: 51048 [2019-12-18 20:50:12,518 INFO L226 Difference]: Without dead ends: 50780 [2019-12-18 20:50:12,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50780 states. [2019-12-18 20:50:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50780 to 36339. [2019-12-18 20:50:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36339 states. [2019-12-18 20:50:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36339 states to 36339 states and 121828 transitions. [2019-12-18 20:50:13,655 INFO L78 Accepts]: Start accepts. Automaton has 36339 states and 121828 transitions. Word has length 22 [2019-12-18 20:50:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:13,655 INFO L462 AbstractCegarLoop]: Abstraction has 36339 states and 121828 transitions. [2019-12-18 20:50:13,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36339 states and 121828 transitions. [2019-12-18 20:50:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:50:13,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:13,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:13,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2069776038, now seen corresponding path program 1 times [2019-12-18 20:50:13,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:13,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077208074] [2019-12-18 20:50:13,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:13,759 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 20:50:13,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077208074] [2019-12-18 20:50:13,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:13,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:13,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585409414] [2019-12-18 20:50:13,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:13,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:13,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:13,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:13,761 INFO L87 Difference]: Start difference. First operand 36339 states and 121828 transitions. Second operand 5 states. [2019-12-18 20:50:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:14,289 INFO L93 Difference]: Finished difference Result 48916 states and 160536 transitions. [2019-12-18 20:50:14,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:14,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 20:50:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:14,369 INFO L225 Difference]: With dead ends: 48916 [2019-12-18 20:50:14,369 INFO L226 Difference]: Without dead ends: 48889 [2019-12-18 20:50:14,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2019-12-18 20:50:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 41136. [2019-12-18 20:50:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41136 states. [2019-12-18 20:50:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41136 states to 41136 states and 136683 transitions. [2019-12-18 20:50:15,116 INFO L78 Accepts]: Start accepts. Automaton has 41136 states and 136683 transitions. Word has length 25 [2019-12-18 20:50:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:15,117 INFO L462 AbstractCegarLoop]: Abstraction has 41136 states and 136683 transitions. [2019-12-18 20:50:15,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41136 states and 136683 transitions. [2019-12-18 20:50:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:50:15,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:15,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:15,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1235001231, now seen corresponding path program 1 times [2019-12-18 20:50:15,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:15,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455815995] [2019-12-18 20:50:15,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:15,219 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 20:50:15,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455815995] [2019-12-18 20:50:15,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:15,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468895957] [2019-12-18 20:50:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:15,221 INFO L87 Difference]: Start difference. First operand 41136 states and 136683 transitions. Second operand 5 states. [2019-12-18 20:50:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:15,332 INFO L93 Difference]: Finished difference Result 17698 states and 55060 transitions. [2019-12-18 20:50:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:15,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:50:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:15,354 INFO L225 Difference]: With dead ends: 17698 [2019-12-18 20:50:15,355 INFO L226 Difference]: Without dead ends: 15112 [2019-12-18 20:50:15,356 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 20:50:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2019-12-18 20:50:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 14720. [2019-12-18 20:50:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14720 states. [2019-12-18 20:50:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14720 states to 14720 states and 45519 transitions. [2019-12-18 20:50:15,807 INFO L78 Accepts]: Start accepts. Automaton has 14720 states and 45519 transitions. Word has length 28 [2019-12-18 20:50:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:15,807 INFO L462 AbstractCegarLoop]: Abstraction has 14720 states and 45519 transitions. [2019-12-18 20:50:15,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14720 states and 45519 transitions. [2019-12-18 20:50:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:15,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:15,827 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 20:50:15,827 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1619802347, now seen corresponding path program 1 times [2019-12-18 20:50:15,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:15,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447547980] [2019-12-18 20:50:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:15,924 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 20:50:15,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447547980] [2019-12-18 20:50:15,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:15,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:15,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061081053] [2019-12-18 20:50:15,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:15,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:15,926 INFO L87 Difference]: Start difference. First operand 14720 states and 45519 transitions. Second operand 5 states. [2019-12-18 20:50:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:16,483 INFO L93 Difference]: Finished difference Result 21622 states and 66199 transitions. [2019-12-18 20:50:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:16,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 20:50:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:16,523 INFO L225 Difference]: With dead ends: 21622 [2019-12-18 20:50:16,524 INFO L226 Difference]: Without dead ends: 21622 [2019-12-18 20:50:16,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21622 states. [2019-12-18 20:50:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21622 to 19702. [2019-12-18 20:50:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19702 states. [2019-12-18 20:50:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19702 states to 19702 states and 60795 transitions. [2019-12-18 20:50:16,819 INFO L78 Accepts]: Start accepts. Automaton has 19702 states and 60795 transitions. Word has length 39 [2019-12-18 20:50:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 19702 states and 60795 transitions. [2019-12-18 20:50:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19702 states and 60795 transitions. [2019-12-18 20:50:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:16,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:16,847 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 20:50:16,847 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1504147243, now seen corresponding path program 2 times [2019-12-18 20:50:16,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:16,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123464854] [2019-12-18 20:50:16,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:16,925 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 20:50:16,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123464854] [2019-12-18 20:50:16,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:16,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:16,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632955073] [2019-12-18 20:50:16,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:16,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:16,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:16,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:16,927 INFO L87 Difference]: Start difference. First operand 19702 states and 60795 transitions. Second operand 3 states. [2019-12-18 20:50:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:17,006 INFO L93 Difference]: Finished difference Result 18777 states and 57281 transitions. [2019-12-18 20:50:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:17,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:50:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:17,039 INFO L225 Difference]: With dead ends: 18777 [2019-12-18 20:50:17,039 INFO L226 Difference]: Without dead ends: 18777 [2019-12-18 20:50:17,040 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 20:50:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18777 states. [2019-12-18 20:50:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18777 to 18641. [2019-12-18 20:50:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18641 states. [2019-12-18 20:50:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18641 states to 18641 states and 56901 transitions. [2019-12-18 20:50:17,299 INFO L78 Accepts]: Start accepts. Automaton has 18641 states and 56901 transitions. Word has length 39 [2019-12-18 20:50:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:17,300 INFO L462 AbstractCegarLoop]: Abstraction has 18641 states and 56901 transitions. [2019-12-18 20:50:17,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18641 states and 56901 transitions. [2019-12-18 20:50:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:17,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:17,320 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 20:50:17,321 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:17,321 INFO L82 PathProgramCache]: Analyzing trace with hash -942169455, now seen corresponding path program 1 times [2019-12-18 20:50:17,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:17,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213562494] [2019-12-18 20:50:17,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:17,417 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 20:50:17,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213562494] [2019-12-18 20:50:17,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:17,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:17,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436921112] [2019-12-18 20:50:17,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:17,420 INFO L87 Difference]: Start difference. First operand 18641 states and 56901 transitions. Second operand 6 states. [2019-12-18 20:50:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:17,596 INFO L93 Difference]: Finished difference Result 17166 states and 53165 transitions. [2019-12-18 20:50:17,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:17,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:50:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:17,635 INFO L225 Difference]: With dead ends: 17166 [2019-12-18 20:50:17,636 INFO L226 Difference]: Without dead ends: 16944 [2019-12-18 20:50:17,636 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 20:50:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-12-18 20:50:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 14950. [2019-12-18 20:50:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14950 states. [2019-12-18 20:50:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 46887 transitions. [2019-12-18 20:50:17,994 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 46887 transitions. Word has length 40 [2019-12-18 20:50:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:17,994 INFO L462 AbstractCegarLoop]: Abstraction has 14950 states and 46887 transitions. [2019-12-18 20:50:17,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 46887 transitions. [2019-12-18 20:50:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:18,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:18,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] [2019-12-18 20:50:18,020 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -59642138, now seen corresponding path program 1 times [2019-12-18 20:50:18,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:18,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247341080] [2019-12-18 20:50:18,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:18,086 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 20:50:18,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247341080] [2019-12-18 20:50:18,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:18,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:18,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370466738] [2019-12-18 20:50:18,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:18,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:18,088 INFO L87 Difference]: Start difference. First operand 14950 states and 46887 transitions. Second operand 4 states. [2019-12-18 20:50:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:18,316 INFO L93 Difference]: Finished difference Result 26854 states and 84163 transitions. [2019-12-18 20:50:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:18,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-18 20:50:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:18,342 INFO L225 Difference]: With dead ends: 26854 [2019-12-18 20:50:18,342 INFO L226 Difference]: Without dead ends: 12352 [2019-12-18 20:50:18,342 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 20:50:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2019-12-18 20:50:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 12352. [2019-12-18 20:50:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12352 states. [2019-12-18 20:50:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12352 states to 12352 states and 38485 transitions. [2019-12-18 20:50:18,583 INFO L78 Accepts]: Start accepts. Automaton has 12352 states and 38485 transitions. Word has length 55 [2019-12-18 20:50:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:18,583 INFO L462 AbstractCegarLoop]: Abstraction has 12352 states and 38485 transitions. [2019-12-18 20:50:18,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12352 states and 38485 transitions. [2019-12-18 20:50:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:18,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:18,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:18,601 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash -532134506, now seen corresponding path program 2 times [2019-12-18 20:50:18,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:18,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285835329] [2019-12-18 20:50:18,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:18,698 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 20:50:18,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285835329] [2019-12-18 20:50:18,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:18,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:18,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817583091] [2019-12-18 20:50:18,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:18,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:18,700 INFO L87 Difference]: Start difference. First operand 12352 states and 38485 transitions. Second operand 6 states. [2019-12-18 20:50:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:19,579 INFO L93 Difference]: Finished difference Result 17653 states and 53858 transitions. [2019-12-18 20:50:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:19,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 20:50:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:19,605 INFO L225 Difference]: With dead ends: 17653 [2019-12-18 20:50:19,606 INFO L226 Difference]: Without dead ends: 17653 [2019-12-18 20:50:19,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:50:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17653 states. [2019-12-18 20:50:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17653 to 13093. [2019-12-18 20:50:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13093 states. [2019-12-18 20:50:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13093 states to 13093 states and 40704 transitions. [2019-12-18 20:50:19,831 INFO L78 Accepts]: Start accepts. Automaton has 13093 states and 40704 transitions. Word has length 55 [2019-12-18 20:50:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:19,832 INFO L462 AbstractCegarLoop]: Abstraction has 13093 states and 40704 transitions. [2019-12-18 20:50:19,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13093 states and 40704 transitions. [2019-12-18 20:50:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:19,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:19,853 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] [2019-12-18 20:50:19,853 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1630106122, now seen corresponding path program 3 times [2019-12-18 20:50:19,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:19,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511475786] [2019-12-18 20:50:19,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:19,950 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 20:50:19,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511475786] [2019-12-18 20:50:19,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:19,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:19,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296014690] [2019-12-18 20:50:19,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:19,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:19,952 INFO L87 Difference]: Start difference. First operand 13093 states and 40704 transitions. Second operand 6 states. [2019-12-18 20:50:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:20,668 INFO L93 Difference]: Finished difference Result 18310 states and 55776 transitions. [2019-12-18 20:50:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:20,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 20:50:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:20,696 INFO L225 Difference]: With dead ends: 18310 [2019-12-18 20:50:20,696 INFO L226 Difference]: Without dead ends: 18310 [2019-12-18 20:50:20,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:50:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18310 states. [2019-12-18 20:50:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18310 to 13950. [2019-12-18 20:50:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13950 states. [2019-12-18 20:50:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13950 states to 13950 states and 43255 transitions. [2019-12-18 20:50:20,941 INFO L78 Accepts]: Start accepts. Automaton has 13950 states and 43255 transitions. Word has length 55 [2019-12-18 20:50:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:20,941 INFO L462 AbstractCegarLoop]: Abstraction has 13950 states and 43255 transitions. [2019-12-18 20:50:20,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 13950 states and 43255 transitions. [2019-12-18 20:50:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:20,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:20,958 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] [2019-12-18 20:50:20,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1570147222, now seen corresponding path program 4 times [2019-12-18 20:50:20,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:20,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432551904] [2019-12-18 20:50:20,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:21,480 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 20:50:21,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432551904] [2019-12-18 20:50:21,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:21,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:50:21,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510266146] [2019-12-18 20:50:21,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 20:50:21,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 20:50:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:50:21,483 INFO L87 Difference]: Start difference. First operand 13950 states and 43255 transitions. Second operand 14 states. [2019-12-18 20:50:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:25,073 INFO L93 Difference]: Finished difference Result 36710 states and 112809 transitions. [2019-12-18 20:50:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 20:50:25,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-18 20:50:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:25,104 INFO L225 Difference]: With dead ends: 36710 [2019-12-18 20:50:25,104 INFO L226 Difference]: Without dead ends: 21225 [2019-12-18 20:50:25,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=472, Invalid=2284, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 20:50:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21225 states. [2019-12-18 20:50:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21225 to 16554. [2019-12-18 20:50:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16554 states. [2019-12-18 20:50:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16554 states to 16554 states and 50556 transitions. [2019-12-18 20:50:25,377 INFO L78 Accepts]: Start accepts. Automaton has 16554 states and 50556 transitions. Word has length 55 [2019-12-18 20:50:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:25,377 INFO L462 AbstractCegarLoop]: Abstraction has 16554 states and 50556 transitions. [2019-12-18 20:50:25,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 20:50:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 16554 states and 50556 transitions. [2019-12-18 20:50:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:25,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:25,395 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] [2019-12-18 20:50:25,395 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 529545476, now seen corresponding path program 5 times [2019-12-18 20:50:25,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:25,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391480699] [2019-12-18 20:50:25,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:25,651 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 20:50:25,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391480699] [2019-12-18 20:50:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:25,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175388156] [2019-12-18 20:50:25,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:25,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:25,658 INFO L87 Difference]: Start difference. First operand 16554 states and 50556 transitions. Second operand 11 states. [2019-12-18 20:50:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:26,958 INFO L93 Difference]: Finished difference Result 38904 states and 119270 transitions. [2019-12-18 20:50:26,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 20:50:26,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:50:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:26,999 INFO L225 Difference]: With dead ends: 38904 [2019-12-18 20:50:26,999 INFO L226 Difference]: Without dead ends: 27353 [2019-12-18 20:50:27,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 20:50:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27353 states. [2019-12-18 20:50:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27353 to 16333. [2019-12-18 20:50:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16333 states. [2019-12-18 20:50:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16333 states to 16333 states and 49978 transitions. [2019-12-18 20:50:27,309 INFO L78 Accepts]: Start accepts. Automaton has 16333 states and 49978 transitions. Word has length 55 [2019-12-18 20:50:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:27,309 INFO L462 AbstractCegarLoop]: Abstraction has 16333 states and 49978 transitions. [2019-12-18 20:50:27,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16333 states and 49978 transitions. [2019-12-18 20:50:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:50:27,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:27,327 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] [2019-12-18 20:50:27,327 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:27,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1727611568, now seen corresponding path program 6 times [2019-12-18 20:50:27,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:27,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800203291] [2019-12-18 20:50:27,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:27,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 20:50:27,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800203291] [2019-12-18 20:50:27,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:27,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049265916] [2019-12-18 20:50:27,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:27,402 INFO L87 Difference]: Start difference. First operand 16333 states and 49978 transitions. Second operand 3 states. [2019-12-18 20:50:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:27,469 INFO L93 Difference]: Finished difference Result 16331 states and 49973 transitions. [2019-12-18 20:50:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:27,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:50:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:27,498 INFO L225 Difference]: With dead ends: 16331 [2019-12-18 20:50:27,499 INFO L226 Difference]: Without dead ends: 16331 [2019-12-18 20:50:27,499 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 20:50:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16331 states. [2019-12-18 20:50:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16331 to 14616. [2019-12-18 20:50:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14616 states. [2019-12-18 20:50:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14616 states to 14616 states and 45159 transitions. [2019-12-18 20:50:27,862 INFO L78 Accepts]: Start accepts. Automaton has 14616 states and 45159 transitions. Word has length 55 [2019-12-18 20:50:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:27,863 INFO L462 AbstractCegarLoop]: Abstraction has 14616 states and 45159 transitions. [2019-12-18 20:50:27,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14616 states and 45159 transitions. [2019-12-18 20:50:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:27,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:27,879 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] [2019-12-18 20:50:27,879 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash -548865040, now seen corresponding path program 1 times [2019-12-18 20:50:27,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:27,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059854564] [2019-12-18 20:50:27,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:50:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:50:28,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:50:28,012 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:50:28,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t666~0.base_27|) (= v_~y~0_18 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~x$r_buff0_thd0~0_21) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~x$r_buff1_thd0~0_23 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t666~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t666~0.base_27|) |v_ULTIMATE.start_main_~#t666~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t666~0.base_27| 1)) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t666~0.base_27| 4) |v_#length_19|) (= v_~x$r_buff1_thd2~0_19 0) (= v_~x$flush_delayed~0_12 0) (= 0 v_~weak$$choice2~0_35) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t666~0.base_27|)) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~x~0_22 0) (= 0 v_~x$w_buff0_used~0_115) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd2~0_25) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t666~0.offset_21|) (= 0 v_~x$w_buff0~0_31) (= v_~x$w_buff1_used~0_68 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t668~0.base=|v_ULTIMATE.start_main_~#t668~0.base_26|, ULTIMATE.start_main_~#t668~0.offset=|v_ULTIMATE.start_main_~#t668~0.offset_20|, ~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t667~0.offset=|v_ULTIMATE.start_main_~#t667~0.offset_20|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t666~0.offset=|v_ULTIMATE.start_main_~#t666~0.offset_21|, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t667~0.base=|v_ULTIMATE.start_main_~#t667~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t666~0.base=|v_ULTIMATE.start_main_~#t666~0.base_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t668~0.base, ULTIMATE.start_main_~#t668~0.offset, ~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t667~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t666~0.offset, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t667~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t666~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:50:28,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-1-->L823: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t667~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t667~0.base_13|) |v_ULTIMATE.start_main_~#t667~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t667~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t667~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t667~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t667~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t667~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t667~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t667~0.base=|v_ULTIMATE.start_main_~#t667~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t667~0.offset=|v_ULTIMATE.start_main_~#t667~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t667~0.base, #length, ULTIMATE.start_main_~#t667~0.offset] because there is no mapped edge [2019-12-18 20:50:28,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t668~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t668~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t668~0.offset_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t668~0.base_12| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t668~0.base_12|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t668~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t668~0.base_12|) |v_ULTIMATE.start_main_~#t668~0.offset_10| 2))) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t668~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t668~0.base=|v_ULTIMATE.start_main_~#t668~0.base_12|, ULTIMATE.start_main_~#t668~0.offset=|v_ULTIMATE.start_main_~#t668~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t668~0.base, ULTIMATE.start_main_~#t668~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:50:28,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_14) (= 1 v_~x$w_buff0_used~0_72) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_73) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:50:28,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L798-2-->L798-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-552256721 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-552256721 256)))) (or (and (= ~x~0_In-552256721 |P2Thread1of1ForFork1_#t~ite32_Out-552256721|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-552256721| ~x$w_buff1~0_In-552256721) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-552256721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552256721, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-552256721, ~x~0=~x~0_In-552256721} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-552256721|, ~x$w_buff1~0=~x$w_buff1~0_In-552256721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552256721, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-552256721, ~x~0=~x~0_In-552256721} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:50:28,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L798-4-->L799: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 20:50:28,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In25165293 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In25165293 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In25165293 |P2Thread1of1ForFork1_#t~ite34_Out25165293|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out25165293|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out25165293|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:50:28,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-580785170 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-580785170 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-580785170| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-580785170| ~x$w_buff0_used~0_In-580785170)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580785170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-580785170, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-580785170|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:50:28,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1518241095 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1518241095 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1518241095 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1518241095 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1518241095| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1518241095| ~x$w_buff1_used~0_In1518241095) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1518241095, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1518241095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518241095} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1518241095, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1518241095, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1518241095, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1518241095|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518241095} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:50:28,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-982222175 256) 0))) (or (and (not .cse0) (= ~x$w_buff0~0_In-982222175 |P0Thread1of1ForFork2_#t~ite9_Out-982222175|) (= |P0Thread1of1ForFork2_#t~ite8_In-982222175| |P0Thread1of1ForFork2_#t~ite8_Out-982222175|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-982222175| |P0Thread1of1ForFork2_#t~ite9_Out-982222175|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-982222175 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-982222175 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-982222175 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-982222175 256))))) (= |P0Thread1of1ForFork2_#t~ite8_Out-982222175| ~x$w_buff0~0_In-982222175)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-982222175, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-982222175, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-982222175|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982222175, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-982222175, ~weak$$choice2~0=~weak$$choice2~0_In-982222175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982222175} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-982222175, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-982222175, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-982222175|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982222175, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-982222175|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-982222175, ~weak$$choice2~0=~weak$$choice2~0_In-982222175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982222175} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:50:28,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-118279233 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-118279233 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-118279233)) (and (= ~x$r_buff0_thd2~0_In-118279233 ~x$r_buff0_thd2~0_Out-118279233) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-118279233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118279233} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-118279233|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-118279233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118279233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:50:28,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1022174472 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1022174472 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1022174472 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1022174472 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1022174472| ~x$r_buff1_thd2~0_In1022174472)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1022174472|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1022174472, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1022174472, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1022174472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022174472} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1022174472|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1022174472, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1022174472, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1022174472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022174472} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:50:28,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 20:50:28,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In191478675 256)))) (or (and (= ~x$w_buff1_used~0_In191478675 |P0Thread1of1ForFork2_#t~ite18_Out191478675|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In191478675| |P0Thread1of1ForFork2_#t~ite17_Out191478675|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out191478675| |P0Thread1of1ForFork2_#t~ite18_Out191478675|) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out191478675| ~x$w_buff1_used~0_In191478675) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In191478675 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In191478675 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In191478675 256)) .cse1) (= (mod ~x$w_buff0_used~0_In191478675 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In191478675, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In191478675|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In191478675, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In191478675, ~weak$$choice2~0=~weak$$choice2~0_In191478675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In191478675} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In191478675, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out191478675|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out191478675|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In191478675, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In191478675, ~weak$$choice2~0=~weak$$choice2~0_In191478675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In191478675} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 20:50:28,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L744-->L745: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_59 v_~x$r_buff0_thd1~0_60)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:50:28,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1562126904 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1562126904 256))) (.cse4 (= |P0Thread1of1ForFork2_#t~ite24_Out-1562126904| |P0Thread1of1ForFork2_#t~ite23_Out-1562126904|)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1562126904 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1562126904 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1562126904 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In-1562126904| |P0Thread1of1ForFork2_#t~ite22_Out-1562126904|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse1 .cse3)) .cse4 (= |P0Thread1of1ForFork2_#t~ite23_Out-1562126904| ~x$r_buff1_thd1~0_In-1562126904) .cse5) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1562126904| |P0Thread1of1ForFork2_#t~ite23_In-1562126904|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1562126904| ~x$r_buff1_thd1~0_In-1562126904) (not .cse5)))) (let ((.cse6 (not .cse1))) (and (or (not .cse3) .cse6) (= |P0Thread1of1ForFork2_#t~ite23_Out-1562126904| |P0Thread1of1ForFork2_#t~ite22_Out-1562126904|) (or .cse6 (not .cse0)) .cse4 (= |P0Thread1of1ForFork2_#t~ite22_Out-1562126904| 0) (not .cse2) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1562126904, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562126904, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1562126904, ~weak$$choice2~0=~weak$$choice2~0_In-1562126904, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1562126904|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-1562126904|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562126904} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1562126904, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562126904, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1562126904, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1562126904|, ~weak$$choice2~0=~weak$$choice2~0_In-1562126904, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1562126904|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-1562126904|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562126904} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 20:50:28,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (= v_~x$mem_tmp~0_5 v_~x~0_17) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 20:50:28,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-761604443 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-761604443 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-761604443 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-761604443 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-761604443 |P2Thread1of1ForFork1_#t~ite35_Out-761604443|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-761604443|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-761604443, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-761604443, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-761604443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-761604443} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-761604443|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-761604443, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-761604443, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-761604443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-761604443} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:50:28,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1174968529 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1174968529 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1174968529| ~x$r_buff0_thd3~0_In1174968529) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1174968529| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1174968529|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:50:28,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-186276122 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-186276122 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-186276122 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-186276122 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-186276122|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-186276122| ~x$r_buff1_thd3~0_In-186276122)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-186276122, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-186276122, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-186276122|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186276122, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-186276122, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:50:28,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L802-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:50:28,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L829-->L831-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= (mod v_~x$w_buff0_used~0_83 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:50:28,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-2-->L831-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1666445025 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1666445025 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1666445025 |ULTIMATE.start_main_#t~ite41_Out1666445025|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1666445025| ~x~0_In1666445025) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1666445025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1666445025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1666445025, ~x~0=~x~0_In1666445025} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1666445025|, ~x$w_buff1~0=~x$w_buff1~0_In1666445025, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1666445025, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1666445025, ~x~0=~x~0_In1666445025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 20:50:28,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L831-4-->L832: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 20:50:28,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1088775334 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1088775334 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1088775334|)) (and (= ~x$w_buff0_used~0_In-1088775334 |ULTIMATE.start_main_#t~ite43_Out-1088775334|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088775334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088775334, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1088775334|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:50:28,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L833-->L833-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1714988571 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1714988571 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1714988571 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1714988571 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1714988571 |ULTIMATE.start_main_#t~ite44_Out1714988571|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1714988571|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1714988571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1714988571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1714988571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1714988571, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1714988571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:50:28,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1007847803 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1007847803 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1007847803| ~x$r_buff0_thd0~0_In-1007847803) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1007847803| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1007847803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1007847803} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1007847803, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1007847803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1007847803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:50:28,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1854737763 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1854737763 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1854737763 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1854737763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1854737763| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-1854737763| ~x$r_buff1_thd0~0_In-1854737763) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1854737763, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1854737763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1854737763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854737763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1854737763, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1854737763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1854737763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1854737763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854737763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:50:28,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y~0_10 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:50:28,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:50:28 BasicIcfg [2019-12-18 20:50:28,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:50:28,141 INFO L168 Benchmark]: Toolchain (without parser) took 69128.84 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.7 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 999.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,142 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.18 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.61 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 156.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,144 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,144 INFO L168 Benchmark]: RCFGBuilder took 820.70 ms. Allocated memory is still 205.0 MB. Free memory was 154.0 MB in the beginning and 107.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,145 INFO L168 Benchmark]: TraceAbstraction took 67457.80 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 107.0 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 938.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:50:28,149 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.18 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.61 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 156.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.10 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.70 ms. Allocated memory is still 205.0 MB. Free memory was 154.0 MB in the beginning and 107.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67457.80 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 107.0 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 938.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6628 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68107 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 y = 2 [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L732] 1 z = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3425 SDtfs, 4314 SDslu, 9124 SDs, 0 SdLazy, 6378 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113136occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 98133 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 109705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...