/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:35:33,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:35:33,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:35:33,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:35:33,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:35:33,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:35:33,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:35:33,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:35:33,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:35:33,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:35:33,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:35:33,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:35:33,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:35:33,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:35:33,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:35:33,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:35:33,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:35:33,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:35:33,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:35:33,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:35:33,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:35:33,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:35:33,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:35:33,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:35:33,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:35:33,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:35:33,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:35:33,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:35:33,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:35:33,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:35:33,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:35:33,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:35:33,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:35:33,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:35:33,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:35:33,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:35:33,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:35:33,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:35:33,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:35:33,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:35:33,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:35:33,993 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-MCR.epf [2019-12-27 20:35:34,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:35:34,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:35:34,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:35:34,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:35:34,034 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:35:34,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:35:34,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:35:34,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:35:34,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:35:34,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:35:34,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:35:34,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:35:34,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:35:34,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:35:34,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:35:34,039 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:35:34,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:35:34,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:35:34,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:35:34,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:35:34,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:35:34,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:35:34,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:35:34,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:35:34,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:35:34,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:35:34,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:35:34,041 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:35:34,042 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:35:34,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:35:34,044 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:35:34,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:35:34,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:35:34,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:35:34,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:35:34,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:35:34,383 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:35:34,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 20:35:34,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6317f7bc1/ef188088960346d38f937a167c36c181/FLAGa3ed3bce2 [2019-12-27 20:35:35,030 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:35:35,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 20:35:35,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6317f7bc1/ef188088960346d38f937a167c36c181/FLAGa3ed3bce2 [2019-12-27 20:35:35,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6317f7bc1/ef188088960346d38f937a167c36c181 [2019-12-27 20:35:35,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:35:35,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:35:35,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:35:35,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:35:35,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:35:35,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:35:35" (1/1) ... [2019-12-27 20:35:35,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:35, skipping insertion in model container [2019-12-27 20:35:35,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:35:35" (1/1) ... [2019-12-27 20:35:35,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:35:35,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:35:35,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:35:35,920 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:35:36,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:35:36,093 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:35:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36 WrapperNode [2019-12-27 20:35:36,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:35:36,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:35:36,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:35:36,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:35:36,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:35:36,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:35:36,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:35:36,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:35:36,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... [2019-12-27 20:35:36,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:35:36,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:35:36,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:35:36,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:35:36,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:35:36,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:35:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:35:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:35:36,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:35:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:35:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:35:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:35:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:35:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:35:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:35:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:35:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:35:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:35:36,294 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:35:37,061 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:35:37,062 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:35:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:35:37 BoogieIcfgContainer [2019-12-27 20:35:37,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:35:37,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:35:37,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:35:37,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:35:37,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:35:35" (1/3) ... [2019-12-27 20:35:37,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e79770f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:35:37, skipping insertion in model container [2019-12-27 20:35:37,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:35:36" (2/3) ... [2019-12-27 20:35:37,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e79770f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:35:37, skipping insertion in model container [2019-12-27 20:35:37,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:35:37" (3/3) ... [2019-12-27 20:35:37,075 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-27 20:35:37,087 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:35:37,087 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:35:37,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:35:37,100 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:35:37,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,189 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,190 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,233 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,233 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:35:37,252 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:35:37,271 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:35:37,271 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:35:37,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:35:37,272 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:35:37,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:35:37,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:35:37,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:35:37,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:35:37,290 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 20:35:37,292 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:35:37,415 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:35:37,415 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:35:37,436 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:35:37,459 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:35:37,559 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:35:37,560 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:35:37,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:35:37,597 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:35:37,598 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:35:41,116 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:35:41,243 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:35:41,274 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 20:35:41,275 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 20:35:41,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 20:36:01,086 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 20:36:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 20:36:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:36:01,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:01,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:36:01,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 20:36:01,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:01,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784995807] [2019-12-27 20:36:01,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:01,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784995807] [2019-12-27 20:36:01,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:01,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:36:01,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705140355] [2019-12-27 20:36:01,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:01,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:01,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:36:01,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:01,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:01,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:36:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:36:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:01,411 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 20:36:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:03,854 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 20:36:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:36:03,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:36:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:04,435 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 20:36:04,436 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 20:36:04,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 20:36:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 20:36:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 20:36:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 20:36:16,808 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 20:36:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:16,808 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 20:36:16,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:36:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 20:36:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:36:16,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:16,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:16,813 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:16,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 20:36:16,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:16,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177572577] [2019-12-27 20:36:16,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177572577] [2019-12-27 20:36:16,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:16,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:16,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836879660] [2019-12-27 20:36:16,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:16,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:16,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:36:16,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:16,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:36:16,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:36:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:36:16,939 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 20:36:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:22,017 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 20:36:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:36:22,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:36:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:22,680 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 20:36:22,680 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 20:36:22,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 20:36:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 20:36:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 20:36:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 20:36:33,147 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 20:36:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:33,148 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 20:36:33,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:36:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 20:36:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:36:33,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:33,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:33,156 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 20:36:33,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:33,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215994461] [2019-12-27 20:36:33,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:33,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215994461] [2019-12-27 20:36:33,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:33,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:33,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955306923] [2019-12-27 20:36:33,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:33,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:33,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:36:33,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:33,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:33,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:36:33,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:36:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:33,228 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 20:36:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:33,391 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 20:36:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:36:33,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:36:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:33,488 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 20:36:33,488 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 20:36:33,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 20:36:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 20:36:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 20:36:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 20:36:39,302 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 20:36:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:39,302 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 20:36:39,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:36:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 20:36:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:36:39,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:39,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:39,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 20:36:39,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:39,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075625677] [2019-12-27 20:36:39,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:39,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075625677] [2019-12-27 20:36:39,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:39,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:36:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16608684] [2019-12-27 20:36:39,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:39,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:39,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:36:39,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:39,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:39,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:36:39,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:36:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:39,391 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 20:36:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:39,599 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 20:36:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:36:39,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:36:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:39,711 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 20:36:39,712 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 20:36:39,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 20:36:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 20:36:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 20:36:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 20:36:40,966 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 20:36:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 20:36:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:36:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 20:36:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:36:40,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:40,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:40,973 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:40,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 20:36:40,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:40,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911172336] [2019-12-27 20:36:40,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:41,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911172336] [2019-12-27 20:36:41,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:41,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:41,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565986806] [2019-12-27 20:36:41,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:41,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:41,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:36:41,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:41,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:41,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:36:41,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:41,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:36:41,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:36:41,091 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 20:36:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:41,535 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 20:36:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:36:41,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:36:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:41,614 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 20:36:41,615 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 20:36:41,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 20:36:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 20:36:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 20:36:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 20:36:42,424 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 20:36:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:42,424 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 20:36:42,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:36:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 20:36:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:36:42,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:42,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:42,428 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 20:36:42,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:42,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365386905] [2019-12-27 20:36:42,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:42,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365386905] [2019-12-27 20:36:42,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:42,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:42,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536156116] [2019-12-27 20:36:42,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:42,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:42,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:36:42,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:42,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:42,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:36:42,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:42,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:36:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:36:42,500 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 20:36:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:43,335 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 20:36:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:36:43,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:36:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:43,428 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 20:36:43,428 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 20:36:43,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 20:36:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 20:36:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 20:36:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 20:36:44,235 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 20:36:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:44,238 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 20:36:44,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:36:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 20:36:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:36:44,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:44,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:44,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 20:36:44,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:44,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608660782] [2019-12-27 20:36:44,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:44,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608660782] [2019-12-27 20:36:44,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:44,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:36:44,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118018801] [2019-12-27 20:36:44,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:44,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:44,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 20:36:44,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:44,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:36:44,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:36:44,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:36:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:44,386 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-27 20:36:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:45,071 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-27 20:36:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:36:45,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:36:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:45,184 INFO L225 Difference]: With dead ends: 63192 [2019-12-27 20:36:45,185 INFO L226 Difference]: Without dead ends: 63185 [2019-12-27 20:36:45,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:36:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-27 20:36:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-27 20:36:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-27 20:36:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-27 20:36:46,551 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-27 20:36:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:46,551 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-27 20:36:46,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:36:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-27 20:36:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:36:46,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:46,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:46,561 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 20:36:46,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:46,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51610968] [2019-12-27 20:36:46,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:46,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51610968] [2019-12-27 20:36:46,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:46,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:36:46,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524488562] [2019-12-27 20:36:46,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:46,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:46,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 20:36:46,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:46,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:36:46,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:36:46,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:46,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:36:46,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:36:46,714 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 6 states. [2019-12-27 20:36:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:47,659 INFO L93 Difference]: Finished difference Result 66601 states and 211587 transitions. [2019-12-27 20:36:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:36:47,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 20:36:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:47,783 INFO L225 Difference]: With dead ends: 66601 [2019-12-27 20:36:47,783 INFO L226 Difference]: Without dead ends: 66594 [2019-12-27 20:36:47,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:36:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66594 states. [2019-12-27 20:36:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66594 to 46346. [2019-12-27 20:36:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46346 states. [2019-12-27 20:36:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46346 states to 46346 states and 150309 transitions. [2019-12-27 20:36:49,176 INFO L78 Accepts]: Start accepts. Automaton has 46346 states and 150309 transitions. Word has length 22 [2019-12-27 20:36:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:49,177 INFO L462 AbstractCegarLoop]: Abstraction has 46346 states and 150309 transitions. [2019-12-27 20:36:49,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:36:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 46346 states and 150309 transitions. [2019-12-27 20:36:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:36:49,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:49,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:49,189 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 20:36:49,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:49,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783699555] [2019-12-27 20:36:49,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:49,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783699555] [2019-12-27 20:36:49,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:49,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:36:49,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090111656] [2019-12-27 20:36:49,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:49,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:49,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:36:49,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:49,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:36:49,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:36:49,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:49,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:36:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:49,296 INFO L87 Difference]: Start difference. First operand 46346 states and 150309 transitions. Second operand 5 states. [2019-12-27 20:36:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:49,419 INFO L93 Difference]: Finished difference Result 17967 states and 55016 transitions. [2019-12-27 20:36:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:36:49,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:36:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:49,460 INFO L225 Difference]: With dead ends: 17967 [2019-12-27 20:36:49,461 INFO L226 Difference]: Without dead ends: 17967 [2019-12-27 20:36:49,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17967 states. [2019-12-27 20:36:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17967 to 17639. [2019-12-27 20:36:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17639 states. [2019-12-27 20:36:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17639 states to 17639 states and 54080 transitions. [2019-12-27 20:36:49,865 INFO L78 Accepts]: Start accepts. Automaton has 17639 states and 54080 transitions. Word has length 25 [2019-12-27 20:36:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:49,866 INFO L462 AbstractCegarLoop]: Abstraction has 17639 states and 54080 transitions. [2019-12-27 20:36:49,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:36:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 17639 states and 54080 transitions. [2019-12-27 20:36:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:36:49,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:49,878 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] [2019-12-27 20:36:49,878 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -990805015, now seen corresponding path program 1 times [2019-12-27 20:36:49,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:49,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520942620] [2019-12-27 20:36:49,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:50,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520942620] [2019-12-27 20:36:50,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:50,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:36:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291273029] [2019-12-27 20:36:50,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:50,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:50,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 102 transitions. [2019-12-27 20:36:50,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:50,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:36:50,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:36:50,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:36:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:36:50,207 INFO L87 Difference]: Start difference. First operand 17639 states and 54080 transitions. Second operand 10 states. [2019-12-27 20:36:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:52,383 INFO L93 Difference]: Finished difference Result 55269 states and 164379 transitions. [2019-12-27 20:36:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:36:52,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 20:36:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:52,465 INFO L225 Difference]: With dead ends: 55269 [2019-12-27 20:36:52,466 INFO L226 Difference]: Without dead ends: 55269 [2019-12-27 20:36:52,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:36:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55269 states. [2019-12-27 20:36:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55269 to 18645. [2019-12-27 20:36:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18645 states. [2019-12-27 20:36:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18645 states to 18645 states and 57270 transitions. [2019-12-27 20:36:53,244 INFO L78 Accepts]: Start accepts. Automaton has 18645 states and 57270 transitions. Word has length 26 [2019-12-27 20:36:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:53,244 INFO L462 AbstractCegarLoop]: Abstraction has 18645 states and 57270 transitions. [2019-12-27 20:36:53,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:36:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 18645 states and 57270 transitions. [2019-12-27 20:36:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:36:53,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:53,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:53,258 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 20:36:53,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:53,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382279872] [2019-12-27 20:36:53,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:53,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382279872] [2019-12-27 20:36:53,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:53,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:36:53,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716059650] [2019-12-27 20:36:53,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:53,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:53,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:36:53,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:53,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:53,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:36:53,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:53,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:36:53,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:53,372 INFO L87 Difference]: Start difference. First operand 18645 states and 57270 transitions. Second operand 5 states. [2019-12-27 20:36:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:53,785 INFO L93 Difference]: Finished difference Result 23296 states and 70408 transitions. [2019-12-27 20:36:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:36:53,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:36:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:53,819 INFO L225 Difference]: With dead ends: 23296 [2019-12-27 20:36:53,819 INFO L226 Difference]: Without dead ends: 23296 [2019-12-27 20:36:53,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:36:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23296 states. [2019-12-27 20:36:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23296 to 21908. [2019-12-27 20:36:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21908 states. [2019-12-27 20:36:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21908 states to 21908 states and 66918 transitions. [2019-12-27 20:36:54,154 INFO L78 Accepts]: Start accepts. Automaton has 21908 states and 66918 transitions. Word has length 27 [2019-12-27 20:36:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:54,155 INFO L462 AbstractCegarLoop]: Abstraction has 21908 states and 66918 transitions. [2019-12-27 20:36:54,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:36:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21908 states and 66918 transitions. [2019-12-27 20:36:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:36:54,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:54,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:54,172 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 20:36:54,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:54,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392385856] [2019-12-27 20:36:54,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392385856] [2019-12-27 20:36:54,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:54,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:36:54,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590277740] [2019-12-27 20:36:54,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:54,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:54,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:36:54,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:54,270 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:54,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:36:54,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:36:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:54,271 INFO L87 Difference]: Start difference. First operand 21908 states and 66918 transitions. Second operand 5 states. [2019-12-27 20:36:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:54,401 INFO L93 Difference]: Finished difference Result 22410 states and 68227 transitions. [2019-12-27 20:36:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:36:54,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:36:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:54,432 INFO L225 Difference]: With dead ends: 22410 [2019-12-27 20:36:54,432 INFO L226 Difference]: Without dead ends: 22410 [2019-12-27 20:36:54,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22410 states. [2019-12-27 20:36:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22410 to 22410. [2019-12-27 20:36:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22410 states. [2019-12-27 20:36:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22410 states to 22410 states and 68227 transitions. [2019-12-27 20:36:54,761 INFO L78 Accepts]: Start accepts. Automaton has 22410 states and 68227 transitions. Word has length 28 [2019-12-27 20:36:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:54,761 INFO L462 AbstractCegarLoop]: Abstraction has 22410 states and 68227 transitions. [2019-12-27 20:36:54,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:36:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22410 states and 68227 transitions. [2019-12-27 20:36:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:36:54,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:54,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:54,782 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 20:36:54,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:54,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940630470] [2019-12-27 20:36:54,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:54,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940630470] [2019-12-27 20:36:54,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:54,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:36:54,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272119456] [2019-12-27 20:36:54,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:54,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:54,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 20:36:54,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:54,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:36:54,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:36:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:36:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:36:54,868 INFO L87 Difference]: Start difference. First operand 22410 states and 68227 transitions. Second operand 5 states. [2019-12-27 20:36:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:55,492 INFO L93 Difference]: Finished difference Result 25710 states and 77140 transitions. [2019-12-27 20:36:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:36:55,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:36:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:55,529 INFO L225 Difference]: With dead ends: 25710 [2019-12-27 20:36:55,529 INFO L226 Difference]: Without dead ends: 25710 [2019-12-27 20:36:55,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:36:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25710 states. [2019-12-27 20:36:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25710 to 21734. [2019-12-27 20:36:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-27 20:36:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 66298 transitions. [2019-12-27 20:36:55,894 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 66298 transitions. Word has length 29 [2019-12-27 20:36:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:55,894 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 66298 transitions. [2019-12-27 20:36:55,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:36:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 66298 transitions. [2019-12-27 20:36:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:36:55,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:55,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:55,917 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 20:36:55,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:55,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224503722] [2019-12-27 20:36:55,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:56,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224503722] [2019-12-27 20:36:56,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:56,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:36:56,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552118134] [2019-12-27 20:36:56,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:56,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:56,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 91 transitions. [2019-12-27 20:36:56,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:56,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:36:56,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:36:56,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:36:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:36:56,053 INFO L87 Difference]: Start difference. First operand 21734 states and 66298 transitions. Second operand 6 states. [2019-12-27 20:36:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:56,928 INFO L93 Difference]: Finished difference Result 29179 states and 86802 transitions. [2019-12-27 20:36:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:36:56,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 20:36:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:56,988 INFO L225 Difference]: With dead ends: 29179 [2019-12-27 20:36:56,988 INFO L226 Difference]: Without dead ends: 29179 [2019-12-27 20:36:56,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:36:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29179 states. [2019-12-27 20:36:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29179 to 22791. [2019-12-27 20:36:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22791 states. [2019-12-27 20:36:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 69171 transitions. [2019-12-27 20:36:57,389 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 69171 transitions. Word has length 33 [2019-12-27 20:36:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:57,389 INFO L462 AbstractCegarLoop]: Abstraction has 22791 states and 69171 transitions. [2019-12-27 20:36:57,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:36:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 69171 transitions. [2019-12-27 20:36:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:36:57,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:57,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:57,410 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 20:36:57,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:57,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559766238] [2019-12-27 20:36:57,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:57,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559766238] [2019-12-27 20:36:57,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:57,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:36:57,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [916321308] [2019-12-27 20:36:57,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:57,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:57,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 95 transitions. [2019-12-27 20:36:57,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:57,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:36:57,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:36:57,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:36:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:36:57,535 INFO L87 Difference]: Start difference. First operand 22791 states and 69171 transitions. Second operand 6 states. [2019-12-27 20:36:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:58,277 INFO L93 Difference]: Finished difference Result 29835 states and 88921 transitions. [2019-12-27 20:36:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:36:58,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 20:36:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:58,339 INFO L225 Difference]: With dead ends: 29835 [2019-12-27 20:36:58,339 INFO L226 Difference]: Without dead ends: 29835 [2019-12-27 20:36:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:36:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29835 states. [2019-12-27 20:36:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29835 to 21049. [2019-12-27 20:36:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21049 states. [2019-12-27 20:36:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21049 states to 21049 states and 64180 transitions. [2019-12-27 20:36:59,113 INFO L78 Accepts]: Start accepts. Automaton has 21049 states and 64180 transitions. Word has length 35 [2019-12-27 20:36:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:59,113 INFO L462 AbstractCegarLoop]: Abstraction has 21049 states and 64180 transitions. [2019-12-27 20:36:59,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:36:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 21049 states and 64180 transitions. [2019-12-27 20:36:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:36:59,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:59,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:59,137 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:36:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 20:36:59,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:59,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482518897] [2019-12-27 20:36:59,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:59,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482518897] [2019-12-27 20:36:59,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:59,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:59,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772919979] [2019-12-27 20:36:59,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:59,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:59,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 20:36:59,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:59,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:36:59,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:36:59,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:36:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:36:59,295 INFO L87 Difference]: Start difference. First operand 21049 states and 64180 transitions. Second operand 4 states. [2019-12-27 20:36:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:59,626 INFO L93 Difference]: Finished difference Result 49953 states and 151526 transitions. [2019-12-27 20:36:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:36:59,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 20:36:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:59,674 INFO L225 Difference]: With dead ends: 49953 [2019-12-27 20:36:59,674 INFO L226 Difference]: Without dead ends: 31859 [2019-12-27 20:36:59,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:36:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31859 states. [2019-12-27 20:37:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31859 to 21483. [2019-12-27 20:37:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21483 states. [2019-12-27 20:37:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21483 states to 21483 states and 63627 transitions. [2019-12-27 20:37:00,057 INFO L78 Accepts]: Start accepts. Automaton has 21483 states and 63627 transitions. Word has length 39 [2019-12-27 20:37:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:00,058 INFO L462 AbstractCegarLoop]: Abstraction has 21483 states and 63627 transitions. [2019-12-27 20:37:00,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:37:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21483 states and 63627 transitions. [2019-12-27 20:37:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:37:00,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:00,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:00,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 20:37:00,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082644195] [2019-12-27 20:37:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:00,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082644195] [2019-12-27 20:37:00,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:00,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:37:00,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340307430] [2019-12-27 20:37:00,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:00,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:00,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 20:37:00,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:00,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:37:00,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:37:00,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:37:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:37:00,366 INFO L87 Difference]: Start difference. First operand 21483 states and 63627 transitions. Second operand 8 states. [2019-12-27 20:37:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:01,466 INFO L93 Difference]: Finished difference Result 30313 states and 88896 transitions. [2019-12-27 20:37:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:37:01,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:37:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:01,509 INFO L225 Difference]: With dead ends: 30313 [2019-12-27 20:37:01,510 INFO L226 Difference]: Without dead ends: 30313 [2019-12-27 20:37:01,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:37:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30313 states. [2019-12-27 20:37:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30313 to 27474. [2019-12-27 20:37:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27474 states. [2019-12-27 20:37:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27474 states to 27474 states and 81312 transitions. [2019-12-27 20:37:01,919 INFO L78 Accepts]: Start accepts. Automaton has 27474 states and 81312 transitions. Word has length 40 [2019-12-27 20:37:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:01,919 INFO L462 AbstractCegarLoop]: Abstraction has 27474 states and 81312 transitions. [2019-12-27 20:37:01,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:37:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27474 states and 81312 transitions. [2019-12-27 20:37:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:37:01,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:01,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:01,947 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 20:37:01,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:01,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092930255] [2019-12-27 20:37:01,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:02,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092930255] [2019-12-27 20:37:02,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:02,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:37:02,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567397655] [2019-12-27 20:37:02,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:02,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:02,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:37:02,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:02,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:37:02,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:37:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:37:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:37:02,388 INFO L87 Difference]: Start difference. First operand 27474 states and 81312 transitions. Second operand 7 states. [2019-12-27 20:37:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:02,535 INFO L93 Difference]: Finished difference Result 25990 states and 77897 transitions. [2019-12-27 20:37:02,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:37:02,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 20:37:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:02,581 INFO L225 Difference]: With dead ends: 25990 [2019-12-27 20:37:02,581 INFO L226 Difference]: Without dead ends: 23577 [2019-12-27 20:37:02,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:37:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23577 states. [2019-12-27 20:37:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23577 to 22569. [2019-12-27 20:37:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22569 states. [2019-12-27 20:37:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22569 states to 22569 states and 69989 transitions. [2019-12-27 20:37:02,955 INFO L78 Accepts]: Start accepts. Automaton has 22569 states and 69989 transitions. Word has length 40 [2019-12-27 20:37:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:02,956 INFO L462 AbstractCegarLoop]: Abstraction has 22569 states and 69989 transitions. [2019-12-27 20:37:02,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:37:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22569 states and 69989 transitions. [2019-12-27 20:37:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:37:02,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:02,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:02,983 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1469321779, now seen corresponding path program 1 times [2019-12-27 20:37:02,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:02,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312943681] [2019-12-27 20:37:02,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:03,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312943681] [2019-12-27 20:37:03,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:03,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:37:03,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [488355512] [2019-12-27 20:37:03,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:03,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:03,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 270 states and 492 transitions. [2019-12-27 20:37:03,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:03,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:37:03,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:37:03,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:37:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:37:03,451 INFO L87 Difference]: Start difference. First operand 22569 states and 69989 transitions. Second operand 7 states. [2019-12-27 20:37:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:04,006 INFO L93 Difference]: Finished difference Result 68604 states and 210669 transitions. [2019-12-27 20:37:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:37:04,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 20:37:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:04,086 INFO L225 Difference]: With dead ends: 68604 [2019-12-27 20:37:04,087 INFO L226 Difference]: Without dead ends: 51453 [2019-12-27 20:37:04,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:37:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51453 states. [2019-12-27 20:37:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51453 to 26191. [2019-12-27 20:37:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26191 states. [2019-12-27 20:37:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26191 states to 26191 states and 81698 transitions. [2019-12-27 20:37:05,104 INFO L78 Accepts]: Start accepts. Automaton has 26191 states and 81698 transitions. Word has length 64 [2019-12-27 20:37:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:05,104 INFO L462 AbstractCegarLoop]: Abstraction has 26191 states and 81698 transitions. [2019-12-27 20:37:05,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:37:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26191 states and 81698 transitions. [2019-12-27 20:37:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:37:05,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:05,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:05,136 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 572317973, now seen corresponding path program 2 times [2019-12-27 20:37:05,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:05,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672073746] [2019-12-27 20:37:05,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:05,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672073746] [2019-12-27 20:37:05,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:05,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:37:05,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965449975] [2019-12-27 20:37:05,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:05,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:05,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 564 transitions. [2019-12-27 20:37:05,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:05,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:37:05,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:37:05,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:37:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:37:05,608 INFO L87 Difference]: Start difference. First operand 26191 states and 81698 transitions. Second operand 10 states. [2019-12-27 20:37:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:08,148 INFO L93 Difference]: Finished difference Result 85496 states and 263148 transitions. [2019-12-27 20:37:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:37:08,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 20:37:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:08,249 INFO L225 Difference]: With dead ends: 85496 [2019-12-27 20:37:08,249 INFO L226 Difference]: Without dead ends: 62914 [2019-12-27 20:37:08,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:37:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62914 states. [2019-12-27 20:37:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62914 to 29715. [2019-12-27 20:37:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29715 states. [2019-12-27 20:37:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29715 states to 29715 states and 92469 transitions. [2019-12-27 20:37:09,422 INFO L78 Accepts]: Start accepts. Automaton has 29715 states and 92469 transitions. Word has length 64 [2019-12-27 20:37:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:09,423 INFO L462 AbstractCegarLoop]: Abstraction has 29715 states and 92469 transitions. [2019-12-27 20:37:09,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:37:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29715 states and 92469 transitions. [2019-12-27 20:37:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:37:09,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:09,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:09,458 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash 584356249, now seen corresponding path program 3 times [2019-12-27 20:37:09,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:09,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587959997] [2019-12-27 20:37:09,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:09,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587959997] [2019-12-27 20:37:09,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:09,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:37:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433916736] [2019-12-27 20:37:09,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:09,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:09,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 401 transitions. [2019-12-27 20:37:09,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:09,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:37:09,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:37:09,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:37:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:37:09,843 INFO L87 Difference]: Start difference. First operand 29715 states and 92469 transitions. Second operand 8 states. [2019-12-27 20:37:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:11,346 INFO L93 Difference]: Finished difference Result 89079 states and 270422 transitions. [2019-12-27 20:37:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:37:11,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 20:37:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:11,468 INFO L225 Difference]: With dead ends: 89079 [2019-12-27 20:37:11,468 INFO L226 Difference]: Without dead ends: 77470 [2019-12-27 20:37:11,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:37:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77470 states. [2019-12-27 20:37:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77470 to 30023. [2019-12-27 20:37:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30023 states. [2019-12-27 20:37:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30023 states to 30023 states and 93420 transitions. [2019-12-27 20:37:12,322 INFO L78 Accepts]: Start accepts. Automaton has 30023 states and 93420 transitions. Word has length 64 [2019-12-27 20:37:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:12,323 INFO L462 AbstractCegarLoop]: Abstraction has 30023 states and 93420 transitions. [2019-12-27 20:37:12,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:37:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30023 states and 93420 transitions. [2019-12-27 20:37:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:37:12,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:12,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:12,356 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1340586405, now seen corresponding path program 4 times [2019-12-27 20:37:12,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:12,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856724002] [2019-12-27 20:37:12,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:12,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856724002] [2019-12-27 20:37:12,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:12,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:37:12,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1094812049] [2019-12-27 20:37:12,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:12,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:12,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 407 transitions. [2019-12-27 20:37:12,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:12,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:37:12,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:37:12,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:37:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:37:12,884 INFO L87 Difference]: Start difference. First operand 30023 states and 93420 transitions. Second operand 3 states. [2019-12-27 20:37:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:13,032 INFO L93 Difference]: Finished difference Result 35908 states and 110472 transitions. [2019-12-27 20:37:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:37:13,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:37:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:13,082 INFO L225 Difference]: With dead ends: 35908 [2019-12-27 20:37:13,083 INFO L226 Difference]: Without dead ends: 35908 [2019-12-27 20:37:13,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:37:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35908 states. [2019-12-27 20:37:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35908 to 31566. [2019-12-27 20:37:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31566 states. [2019-12-27 20:37:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31566 states to 31566 states and 97935 transitions. [2019-12-27 20:37:13,614 INFO L78 Accepts]: Start accepts. Automaton has 31566 states and 97935 transitions. Word has length 64 [2019-12-27 20:37:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:13,614 INFO L462 AbstractCegarLoop]: Abstraction has 31566 states and 97935 transitions. [2019-12-27 20:37:13,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:37:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 31566 states and 97935 transitions. [2019-12-27 20:37:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:37:13,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:13,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:13,650 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -87540519, now seen corresponding path program 1 times [2019-12-27 20:37:13,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:13,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139989671] [2019-12-27 20:37:13,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:13,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139989671] [2019-12-27 20:37:13,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:13,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:37:13,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974336462] [2019-12-27 20:37:13,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:13,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:13,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 407 transitions. [2019-12-27 20:37:13,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:13,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:37:13,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:37:13,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:13,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:37:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:37:13,999 INFO L87 Difference]: Start difference. First operand 31566 states and 97935 transitions. Second operand 4 states. [2019-12-27 20:37:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:14,280 INFO L93 Difference]: Finished difference Result 36423 states and 109930 transitions. [2019-12-27 20:37:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:37:14,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 20:37:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:14,330 INFO L225 Difference]: With dead ends: 36423 [2019-12-27 20:37:14,330 INFO L226 Difference]: Without dead ends: 36423 [2019-12-27 20:37:14,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:37:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36423 states. [2019-12-27 20:37:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36423 to 26119. [2019-12-27 20:37:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26119 states. [2019-12-27 20:37:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26119 states to 26119 states and 79396 transitions. [2019-12-27 20:37:15,116 INFO L78 Accepts]: Start accepts. Automaton has 26119 states and 79396 transitions. Word has length 65 [2019-12-27 20:37:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:15,116 INFO L462 AbstractCegarLoop]: Abstraction has 26119 states and 79396 transitions. [2019-12-27 20:37:15,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:37:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26119 states and 79396 transitions. [2019-12-27 20:37:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:15,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:15,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:15,144 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-27 20:37:15,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:15,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502026794] [2019-12-27 20:37:15,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:15,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502026794] [2019-12-27 20:37:15,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:15,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:37:15,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444268879] [2019-12-27 20:37:15,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:15,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:15,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 664 transitions. [2019-12-27 20:37:15,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:16,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:37:16,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:37:16,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:37:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:37:16,005 INFO L87 Difference]: Start difference. First operand 26119 states and 79396 transitions. Second operand 14 states. [2019-12-27 20:37:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:18,237 INFO L93 Difference]: Finished difference Result 60925 states and 185073 transitions. [2019-12-27 20:37:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 20:37:18,237 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:37:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:18,328 INFO L225 Difference]: With dead ends: 60925 [2019-12-27 20:37:18,329 INFO L226 Difference]: Without dead ends: 56219 [2019-12-27 20:37:18,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 20:37:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56219 states. [2019-12-27 20:37:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56219 to 31956. [2019-12-27 20:37:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31956 states. [2019-12-27 20:37:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31956 states to 31956 states and 97279 transitions. [2019-12-27 20:37:19,431 INFO L78 Accepts]: Start accepts. Automaton has 31956 states and 97279 transitions. Word has length 66 [2019-12-27 20:37:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:19,431 INFO L462 AbstractCegarLoop]: Abstraction has 31956 states and 97279 transitions. [2019-12-27 20:37:19,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:37:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 31956 states and 97279 transitions. [2019-12-27 20:37:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:19,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:19,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:19,470 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1067264281, now seen corresponding path program 2 times [2019-12-27 20:37:19,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:19,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571509944] [2019-12-27 20:37:19,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:19,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571509944] [2019-12-27 20:37:19,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:19,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:37:19,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069661997] [2019-12-27 20:37:19,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:19,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:20,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 415 states and 878 transitions. [2019-12-27 20:37:20,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:20,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:37:20,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:37:20,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:37:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:37:20,503 INFO L87 Difference]: Start difference. First operand 31956 states and 97279 transitions. Second operand 15 states. [2019-12-27 20:37:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:23,407 INFO L93 Difference]: Finished difference Result 70323 states and 211427 transitions. [2019-12-27 20:37:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 20:37:23,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 20:37:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:23,496 INFO L225 Difference]: With dead ends: 70323 [2019-12-27 20:37:23,496 INFO L226 Difference]: Without dead ends: 60024 [2019-12-27 20:37:23,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1270, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 20:37:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60024 states. [2019-12-27 20:37:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60024 to 26096. [2019-12-27 20:37:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26096 states. [2019-12-27 20:37:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26096 states to 26096 states and 78779 transitions. [2019-12-27 20:37:24,551 INFO L78 Accepts]: Start accepts. Automaton has 26096 states and 78779 transitions. Word has length 66 [2019-12-27 20:37:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:24,551 INFO L462 AbstractCegarLoop]: Abstraction has 26096 states and 78779 transitions. [2019-12-27 20:37:24,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:37:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26096 states and 78779 transitions. [2019-12-27 20:37:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:24,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:24,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:24,581 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash -874977571, now seen corresponding path program 3 times [2019-12-27 20:37:24,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:24,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863045135] [2019-12-27 20:37:24,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:24,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863045135] [2019-12-27 20:37:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:37:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400370328] [2019-12-27 20:37:24,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:24,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:25,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 330 states and 672 transitions. [2019-12-27 20:37:25,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:25,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:37:25,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:37:25,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:37:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:37:25,250 INFO L87 Difference]: Start difference. First operand 26096 states and 78779 transitions. Second operand 14 states. [2019-12-27 20:37:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:30,068 INFO L93 Difference]: Finished difference Result 55614 states and 164554 transitions. [2019-12-27 20:37:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:37:30,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 20:37:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:30,148 INFO L225 Difference]: With dead ends: 55614 [2019-12-27 20:37:30,149 INFO L226 Difference]: Without dead ends: 55342 [2019-12-27 20:37:30,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:37:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55342 states. [2019-12-27 20:37:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55342 to 27989. [2019-12-27 20:37:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-27 20:37:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84201 transitions. [2019-12-27 20:37:31,213 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84201 transitions. Word has length 66 [2019-12-27 20:37:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:31,213 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84201 transitions. [2019-12-27 20:37:31,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:37:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84201 transitions. [2019-12-27 20:37:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:31,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:31,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:31,243 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash 922760775, now seen corresponding path program 4 times [2019-12-27 20:37:31,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:31,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440735837] [2019-12-27 20:37:31,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:31,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440735837] [2019-12-27 20:37:31,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:31,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:37:31,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157320309] [2019-12-27 20:37:31,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:31,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:31,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 542 transitions. [2019-12-27 20:37:31,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:31,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:37:31,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:37:31,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:31,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:37:31,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:37:31,973 INFO L87 Difference]: Start difference. First operand 27989 states and 84201 transitions. Second operand 15 states. [2019-12-27 20:37:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:33,305 INFO L93 Difference]: Finished difference Result 50819 states and 151912 transitions. [2019-12-27 20:37:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:37:33,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 20:37:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:33,376 INFO L225 Difference]: With dead ends: 50819 [2019-12-27 20:37:33,377 INFO L226 Difference]: Without dead ends: 49683 [2019-12-27 20:37:33,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:37:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49683 states. [2019-12-27 20:37:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49683 to 27327. [2019-12-27 20:37:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27327 states. [2019-12-27 20:37:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27327 states to 27327 states and 82380 transitions. [2019-12-27 20:37:33,955 INFO L78 Accepts]: Start accepts. Automaton has 27327 states and 82380 transitions. Word has length 66 [2019-12-27 20:37:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:33,956 INFO L462 AbstractCegarLoop]: Abstraction has 27327 states and 82380 transitions. [2019-12-27 20:37:33,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:37:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27327 states and 82380 transitions. [2019-12-27 20:37:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:33,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:33,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:33,987 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash -443600917, now seen corresponding path program 5 times [2019-12-27 20:37:33,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:33,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678424240] [2019-12-27 20:37:33,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:34,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678424240] [2019-12-27 20:37:34,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:34,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:37:34,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227998103] [2019-12-27 20:37:34,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:34,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:34,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 359 transitions. [2019-12-27 20:37:34,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:35,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 20:37:35,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:37:35,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:35,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:37:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:37:35,099 INFO L87 Difference]: Start difference. First operand 27327 states and 82380 transitions. Second operand 17 states. [2019-12-27 20:37:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:41,763 INFO L93 Difference]: Finished difference Result 56845 states and 167837 transitions. [2019-12-27 20:37:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:37:41,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 20:37:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:41,852 INFO L225 Difference]: With dead ends: 56845 [2019-12-27 20:37:41,852 INFO L226 Difference]: Without dead ends: 56845 [2019-12-27 20:37:41,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=363, Invalid=1893, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 20:37:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56845 states. [2019-12-27 20:37:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56845 to 29770. [2019-12-27 20:37:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29770 states. [2019-12-27 20:37:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29770 states to 29770 states and 89710 transitions. [2019-12-27 20:37:42,524 INFO L78 Accepts]: Start accepts. Automaton has 29770 states and 89710 transitions. Word has length 66 [2019-12-27 20:37:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 29770 states and 89710 transitions. [2019-12-27 20:37:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:37:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29770 states and 89710 transitions. [2019-12-27 20:37:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:37:42,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:42,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:42,560 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1157879145, now seen corresponding path program 6 times [2019-12-27 20:37:42,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:42,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795973937] [2019-12-27 20:37:42,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:42,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795973937] [2019-12-27 20:37:42,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:42,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:37:42,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470897001] [2019-12-27 20:37:42,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:42,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:42,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 406 transitions. [2019-12-27 20:37:42,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:42,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:37:42,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:37:42,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:37:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:37:42,987 INFO L87 Difference]: Start difference. First operand 29770 states and 89710 transitions. Second operand 3 states. [2019-12-27 20:37:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:43,343 INFO L93 Difference]: Finished difference Result 29769 states and 89708 transitions. [2019-12-27 20:37:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:37:43,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:37:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:43,397 INFO L225 Difference]: With dead ends: 29769 [2019-12-27 20:37:43,397 INFO L226 Difference]: Without dead ends: 29769 [2019-12-27 20:37:43,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:37:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29769 states. [2019-12-27 20:37:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29769 to 21970. [2019-12-27 20:37:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21970 states. [2019-12-27 20:37:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21970 states to 21970 states and 67086 transitions. [2019-12-27 20:37:44,020 INFO L78 Accepts]: Start accepts. Automaton has 21970 states and 67086 transitions. Word has length 66 [2019-12-27 20:37:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:44,020 INFO L462 AbstractCegarLoop]: Abstraction has 21970 states and 67086 transitions. [2019-12-27 20:37:44,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:37:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21970 states and 67086 transitions. [2019-12-27 20:37:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:37:44,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:44,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:44,054 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 1 times [2019-12-27 20:37:44,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:44,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105472978] [2019-12-27 20:37:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:37:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:37:44,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:37:44,202 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:37:44,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_21|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21|) 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_21| 1)) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_21| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_21|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_15|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_20|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:37:44,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:37:44,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-27 20:37:44,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-27 20:37:44,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In338560648 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out338560648| |P1Thread1of1ForFork2_#t~ite10_Out338560648|)) (.cse1 (= (mod ~z$w_buff1_used~0_In338560648 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out338560648| ~z~0_In338560648) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out338560648| ~z$w_buff1~0_In338560648) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In338560648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In338560648, ~z$w_buff1~0=~z$w_buff1~0_In338560648, ~z~0=~z~0_In338560648} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out338560648|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In338560648, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out338560648|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In338560648, ~z$w_buff1~0=~z$w_buff1~0_In338560648, ~z~0=~z~0_In338560648} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:37:44,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In602132045 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out602132045| |P2Thread1of1ForFork0_#t~ite23_Out602132045|) (= |P2Thread1of1ForFork0_#t~ite23_Out602132045| ~z$w_buff1~0_In602132045) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In602132045 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In602132045 256)) (and (= (mod ~z$w_buff1_used~0_In602132045 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In602132045 256)) .cse1)))) (and (= |P2Thread1of1ForFork0_#t~ite24_Out602132045| ~z$w_buff1~0_In602132045) (= |P2Thread1of1ForFork0_#t~ite23_In602132045| |P2Thread1of1ForFork0_#t~ite23_Out602132045|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602132045, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In602132045|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$w_buff1~0=~z$w_buff1~0_In602132045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602132045, ~weak$$choice2~0=~weak$$choice2~0_In602132045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In602132045, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out602132045|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602132045, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out602132045|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602132045, ~z$w_buff1~0=~z$w_buff1~0_In602132045, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602132045, ~weak$$choice2~0=~weak$$choice2~0_In602132045} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:37:44,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1149405393 256) 0)) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In1149405393 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1149405393 256) 0)) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out1149405393| |P2Thread1of1ForFork0_#t~ite29_Out1149405393|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1149405393 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1149405393 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In1149405393| |P2Thread1of1ForFork0_#t~ite28_Out1149405393|) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out1149405393| ~z$w_buff1_used~0_In1149405393) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In1149405393| |P2Thread1of1ForFork0_#t~ite29_Out1149405393|)) (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4)) (= |P2Thread1of1ForFork0_#t~ite29_Out1149405393| ~z$w_buff1_used~0_In1149405393) .cse5))) (let ((.cse6 (not .cse3))) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1149405393| |P2Thread1of1ForFork0_#t~ite29_Out1149405393|) .cse0 (or .cse6 (not .cse4)) (not .cse1) .cse5 (= |P2Thread1of1ForFork0_#t~ite28_Out1149405393| 0) (or (not .cse2) .cse6))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1149405393|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1149405393, ~weak$$choice2~0=~weak$$choice2~0_In1149405393, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1149405393|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1149405393|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1149405393, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1149405393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1149405393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1149405393, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1149405393|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1149405393|, ~weak$$choice2~0=~weak$$choice2~0_In1149405393} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:37:44,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:37:44,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:37:44,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-698493832| |P2Thread1of1ForFork0_#t~ite38_Out-698493832|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-698493832 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-698493832 256) 0))) (or (and (= ~z~0_In-698493832 |P2Thread1of1ForFork0_#t~ite38_Out-698493832|) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-698493832 |P2Thread1of1ForFork0_#t~ite38_Out-698493832|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-698493832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-698493832, ~z$w_buff1~0=~z$w_buff1~0_In-698493832, ~z~0=~z~0_In-698493832} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-698493832|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-698493832|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-698493832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-698493832, ~z$w_buff1~0=~z$w_buff1~0_In-698493832, ~z~0=~z~0_In-698493832} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:37:44,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2136486380 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2136486380 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2136486380 |P2Thread1of1ForFork0_#t~ite40_Out2136486380|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out2136486380|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2136486380, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2136486380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2136486380, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2136486380|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2136486380} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:37:44,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2133768487 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2133768487 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In2133768487 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2133768487 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out2133768487|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In2133768487 |P2Thread1of1ForFork0_#t~ite41_Out2133768487|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2133768487, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2133768487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133768487, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2133768487} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2133768487, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2133768487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2133768487, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2133768487, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2133768487|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:37:44,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1947390120 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1947390120 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1947390120| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1947390120| ~z$r_buff0_thd3~0_In-1947390120)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1947390120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1947390120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1947390120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1947390120, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1947390120|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:37:44,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1678065001 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1678065001 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1678065001 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1678065001 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1678065001 |P2Thread1of1ForFork0_#t~ite43_Out1678065001|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1678065001|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1678065001, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1678065001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1678065001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1678065001} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1678065001|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1678065001, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1678065001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1678065001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1678065001} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:37:44,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:37:44,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-725163360 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-725163360 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-725163360|)) (and (= ~z$w_buff0_used~0_In-725163360 |P0Thread1of1ForFork1_#t~ite5_Out-725163360|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-725163360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-725163360} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-725163360|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-725163360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-725163360} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:37:44,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In461462491 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In461462491 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In461462491 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In461462491 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In461462491 |P0Thread1of1ForFork1_#t~ite6_Out461462491|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out461462491| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In461462491, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In461462491, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461462491, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In461462491} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In461462491, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out461462491|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In461462491, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461462491, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In461462491} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:37:44,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1991595457 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1991595457 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1991595457 ~z$r_buff0_thd1~0_Out-1991595457)) (and (= 0 ~z$r_buff0_thd1~0_Out-1991595457) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991595457, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1991595457} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991595457, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1991595457|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1991595457} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:37:44,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-408601387 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-408601387 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-408601387 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-408601387 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-408601387| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-408601387| ~z$r_buff1_thd1~0_In-408601387)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-408601387, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-408601387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408601387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-408601387} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-408601387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-408601387, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-408601387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-408601387, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-408601387} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:37:44,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:37:44,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In537712156 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In537712156 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out537712156| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out537712156| ~z$w_buff0_used~0_In537712156)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In537712156, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In537712156} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In537712156, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out537712156|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In537712156} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:37:44,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In-1034112489 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1034112489 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1034112489 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1034112489 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1034112489| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1034112489| ~z$w_buff1_used~0_In-1034112489) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1034112489, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1034112489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1034112489, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1034112489} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1034112489, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1034112489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1034112489, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1034112489|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1034112489} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:37:44,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-40763494 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-40763494 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-40763494 |P1Thread1of1ForFork2_#t~ite13_Out-40763494|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-40763494|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-40763494, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-40763494} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-40763494, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-40763494|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-40763494} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:37:44,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-170866210 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-170866210 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-170866210 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-170866210 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-170866210| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-170866210| ~z$r_buff1_thd2~0_In-170866210)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-170866210, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-170866210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170866210, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-170866210} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-170866210, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-170866210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170866210, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-170866210|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-170866210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:37:44,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:37:44,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:37:44,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2112432425 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2112432425 256)))) (or (and (= ~z$w_buff1~0_In2112432425 |ULTIMATE.start_main_#t~ite47_Out2112432425|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In2112432425 |ULTIMATE.start_main_#t~ite47_Out2112432425|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2112432425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2112432425, ~z$w_buff1~0=~z$w_buff1~0_In2112432425, ~z~0=~z~0_In2112432425} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2112432425, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2112432425|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2112432425, ~z$w_buff1~0=~z$w_buff1~0_In2112432425, ~z~0=~z~0_In2112432425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:37:44,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 20:37:44,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1682812259 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1682812259 256)))) (or (and (= ~z$w_buff0_used~0_In-1682812259 |ULTIMATE.start_main_#t~ite49_Out-1682812259|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1682812259| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1682812259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682812259} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1682812259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682812259, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1682812259|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:37:44,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1165614605 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1165614605 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1165614605 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1165614605 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1165614605 |ULTIMATE.start_main_#t~ite50_Out-1165614605|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1165614605|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165614605, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165614605, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165614605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165614605} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1165614605|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165614605, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165614605, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165614605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165614605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:37:44,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1400273227 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1400273227 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1400273227|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1400273227 |ULTIMATE.start_main_#t~ite51_Out1400273227|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1400273227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1400273227} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1400273227, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1400273227|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1400273227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:37:44,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-2039518954 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2039518954 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2039518954 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2039518954 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-2039518954| ~z$r_buff1_thd0~0_In-2039518954) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-2039518954| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2039518954, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2039518954, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2039518954, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039518954} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2039518954|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2039518954, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2039518954, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2039518954, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039518954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:37:44,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:37:44,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:37:44 BasicIcfg [2019-12-27 20:37:44,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:37:44,358 INFO L168 Benchmark]: Toolchain (without parser) took 129060.85 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,359 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.18 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 152.8 MB in the end (delta: -52.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,365 INFO L168 Benchmark]: Boogie Preprocessor took 41.33 ms. Allocated memory is still 199.8 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,369 INFO L168 Benchmark]: RCFGBuilder took 864.48 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 97.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,369 INFO L168 Benchmark]: TraceAbstraction took 127290.69 ms. Allocated memory was 199.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 20:37:44,374 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.18 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 100.4 MB in the beginning and 152.8 MB in the end (delta: -52.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.33 ms. Allocated memory is still 199.8 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 864.48 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 97.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127290.69 ms. Allocated memory was 199.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __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=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 126.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7666 SDtfs, 10334 SDslu, 32186 SDs, 0 SdLazy, 22191 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 152 SyntacticMatches, 80 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 48.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 412178 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 260024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...