/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/mix041_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:15,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:15,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:15,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:15,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:15,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:15,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:15,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:15,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:15,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:15,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:15,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:15,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:15,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:15,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:15,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:15,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:15,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:15,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:15,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:15,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:15,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:15,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:15,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:15,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:15,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:15,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:15,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:15,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:15,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:15,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:15,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:15,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:15,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:15,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:15,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:15,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:15,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:15,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:15,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:15,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:15,169 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 21:12:15,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:15,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:15,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:15,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:15,200 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:15,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:15,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:15,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:15,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:15,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:15,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:15,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:15,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:15,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:15,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:15,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:15,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:15,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:15,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:15,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:15,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:15,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:15,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:15,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:15,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:15,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:15,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:15,206 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:15,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:15,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:15,207 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:15,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:15,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:15,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:15,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:15,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:15,492 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:15,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 21:12:15,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3a1208b/ead9503afc47404d951c1cd5420bf2c1/FLAG7be04da9e [2019-12-27 21:12:16,106 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:12:16,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 21:12:16,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3a1208b/ead9503afc47404d951c1cd5420bf2c1/FLAG7be04da9e [2019-12-27 21:12:16,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3a1208b/ead9503afc47404d951c1cd5420bf2c1 [2019-12-27 21:12:16,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:12:16,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:12:16,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:16,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:12:16,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:12:16,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:16" (1/1) ... [2019-12-27 21:12:16,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:16, skipping insertion in model container [2019-12-27 21:12:16,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:16" (1/1) ... [2019-12-27 21:12:16,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:12:16,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:12:16,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:16,949 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:12:17,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:17,136 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:12:17,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17 WrapperNode [2019-12-27 21:12:17,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:17,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:17,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:12:17,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:12:17,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:17,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:12:17,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:12:17,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:12:17,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (1/1) ... [2019-12-27 21:12:17,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:12:17,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:12:17,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:12:17,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:12:17,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (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 21:12:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:12:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:12:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:12:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:12:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:12:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:12:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:12:17,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:12:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:12:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:12:17,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:12:17,319 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 21:12:18,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:12:18,037 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:12:18,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:18 BoogieIcfgContainer [2019-12-27 21:12:18,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:12:18,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:12:18,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:12:18,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:12:18,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:12:16" (1/3) ... [2019-12-27 21:12:18,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a025b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:18, skipping insertion in model container [2019-12-27 21:12:18,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:17" (2/3) ... [2019-12-27 21:12:18,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408a025b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:18, skipping insertion in model container [2019-12-27 21:12:18,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:18" (3/3) ... [2019-12-27 21:12:18,055 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-12-27 21:12:18,066 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:12:18,067 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:12:18,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:12:18,082 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:12:18,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:18,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:12:18,256 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:12:18,256 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:12:18,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:12:18,256 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:12:18,257 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:12:18,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:12:18,257 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:12:18,257 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:12:18,274 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:12:18,276 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:18,369 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:18,369 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:18,383 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:18,402 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:18,459 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:18,459 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:18,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:18,485 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:12:18,487 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:21,763 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:12:21,882 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:12:21,907 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49804 [2019-12-27 21:12:21,908 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 21:12:21,911 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 21:12:22,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 21:12:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 21:12:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:12:22,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:22,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:12:22,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 792295, now seen corresponding path program 1 times [2019-12-27 21:12:22,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550153290] [2019-12-27 21:12:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:22,596 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 21:12:22,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550153290] [2019-12-27 21:12:22,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:22,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:12:22,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1230840811] [2019-12-27 21:12:22,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:22,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:22,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:12:22,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:22,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:22,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:22,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:22,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:22,681 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 21:12:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:22,915 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 21:12:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:22,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:12:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:22,995 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 21:12:22,995 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 21:12:22,997 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 21:12:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 21:12:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 21:12:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 21:12:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 21:12:23,388 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 21:12:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:23,389 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 21:12:23,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 21:12:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:12:23,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:23,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:23,393 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1331077168, now seen corresponding path program 1 times [2019-12-27 21:12:23,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:23,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730161739] [2019-12-27 21:12:23,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:23,503 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 21:12:23,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730161739] [2019-12-27 21:12:23,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:23,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:23,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998451370] [2019-12-27 21:12:23,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:23,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:23,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:12:23,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:23,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:23,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:23,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:23,510 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 21:12:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:23,539 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 21:12:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:23,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:12:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:23,546 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 21:12:23,546 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 21:12:23,547 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 21:12:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 21:12:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 21:12:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:12:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 21:12:23,577 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 21:12:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:23,577 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 21:12:23,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 21:12:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:23,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:23,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:23,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:23,580 INFO L82 PathProgramCache]: Analyzing trace with hash 265392593, now seen corresponding path program 1 times [2019-12-27 21:12:23,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:23,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673527290] [2019-12-27 21:12:23,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:23,648 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 21:12:23,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673527290] [2019-12-27 21:12:23,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:23,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:23,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1449755382] [2019-12-27 21:12:23,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:23,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:23,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:23,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:23,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:23,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:23,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:23,697 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 21:12:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:23,781 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 21:12:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:23,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 21:12:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:23,793 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 21:12:23,793 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 21:12:23,793 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 21:12:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 21:12:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 21:12:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 21:12:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 21:12:23,842 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 21:12:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:23,842 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 21:12:23,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 21:12:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:23,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:23,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:23,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash 175245027, now seen corresponding path program 1 times [2019-12-27 21:12:23,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:23,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506627247] [2019-12-27 21:12:23,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:23,954 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 21:12:23,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506627247] [2019-12-27 21:12:23,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:23,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:23,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666854477] [2019-12-27 21:12:23,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:23,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:23,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:23,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:23,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:23,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:23,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:23,966 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 21:12:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:24,149 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 21:12:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:24,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:24,159 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 21:12:24,159 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 21:12:24,160 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 21:12:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 21:12:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 21:12:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 21:12:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 21:12:24,201 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 21:12:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:24,202 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 21:12:24,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 21:12:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:24,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:24,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:24,203 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash 941909210, now seen corresponding path program 1 times [2019-12-27 21:12:24,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:24,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125308634] [2019-12-27 21:12:24,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:24,252 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 21:12:24,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125308634] [2019-12-27 21:12:24,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:24,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:24,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842991294] [2019-12-27 21:12:24,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:24,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:24,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:24,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:24,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:24,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:24,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:24,259 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 21:12:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:24,432 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 21:12:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:24,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:24,444 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 21:12:24,444 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 21:12:24,444 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 21:12:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 21:12:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 21:12:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 21:12:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 21:12:24,487 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 21:12:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:24,488 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 21:12:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 21:12:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:24,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:24,490 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 21:12:24,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1601113905, now seen corresponding path program 1 times [2019-12-27 21:12:24,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:24,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328988565] [2019-12-27 21:12:24,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:24,550 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 21:12:24,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328988565] [2019-12-27 21:12:24,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:24,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:24,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223124623] [2019-12-27 21:12:24,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:24,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:24,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:24,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:24,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:24,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:24,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:24,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:24,563 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 21:12:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:24,836 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 21:12:24,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:24,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:12:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:24,850 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 21:12:24,851 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 21:12:24,851 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 21:12:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 21:12:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 21:12:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 21:12:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 21:12:24,896 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 21:12:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:24,897 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 21:12:24,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 21:12:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:24,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:24,900 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 21:12:24,900 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash 16465726, now seen corresponding path program 1 times [2019-12-27 21:12:24,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:24,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126034369] [2019-12-27 21:12:24,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:24,945 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 21:12:24,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126034369] [2019-12-27 21:12:24,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:24,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:24,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510787046] [2019-12-27 21:12:24,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:24,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:24,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:24,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:24,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:24,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:24,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:24,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:24,963 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 21:12:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:25,065 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 21:12:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:25,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 21:12:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:25,073 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 21:12:25,073 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 21:12:25,074 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 21:12:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 21:12:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 21:12:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 21:12:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 21:12:25,119 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 21:12:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:25,120 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 21:12:25,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 21:12:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:25,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:25,122 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 21:12:25,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1111732337, now seen corresponding path program 1 times [2019-12-27 21:12:25,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:25,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222346553] [2019-12-27 21:12:25,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:25,172 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 21:12:25,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222346553] [2019-12-27 21:12:25,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:25,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:25,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164420911] [2019-12-27 21:12:25,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:25,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:25,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:12:25,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:25,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:12:25,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:25,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:25,235 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 21:12:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:25,261 INFO L93 Difference]: Finished difference Result 3059 states and 6636 transitions. [2019-12-27 21:12:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:25,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 21:12:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:25,267 INFO L225 Difference]: With dead ends: 3059 [2019-12-27 21:12:25,267 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 21:12:25,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 21:12:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1385. [2019-12-27 21:12:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-12-27 21:12:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2946 transitions. [2019-12-27 21:12:25,297 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2946 transitions. Word has length 26 [2019-12-27 21:12:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:25,298 INFO L462 AbstractCegarLoop]: Abstraction has 1385 states and 2946 transitions. [2019-12-27 21:12:25,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2946 transitions. [2019-12-27 21:12:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:25,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:25,300 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 21:12:25,300 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash 858483252, now seen corresponding path program 1 times [2019-12-27 21:12:25,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:25,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976884609] [2019-12-27 21:12:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:25,387 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 21:12:25,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976884609] [2019-12-27 21:12:25,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:25,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:25,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394433860] [2019-12-27 21:12:25,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:25,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:25,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:12:25,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:25,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:25,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:25,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:25,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:25,411 INFO L87 Difference]: Start difference. First operand 1385 states and 2946 transitions. Second operand 5 states. [2019-12-27 21:12:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:25,552 INFO L93 Difference]: Finished difference Result 1390 states and 2937 transitions. [2019-12-27 21:12:25,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:25,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:12:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:25,556 INFO L225 Difference]: With dead ends: 1390 [2019-12-27 21:12:25,557 INFO L226 Difference]: Without dead ends: 1390 [2019-12-27 21:12:25,557 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 21:12:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-27 21:12:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1347. [2019-12-27 21:12:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-12-27 21:12:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2871 transitions. [2019-12-27 21:12:25,585 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2871 transitions. Word has length 26 [2019-12-27 21:12:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:25,585 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2871 transitions. [2019-12-27 21:12:25,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2871 transitions. [2019-12-27 21:12:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:12:25,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:25,588 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 21:12:25,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1256798795, now seen corresponding path program 1 times [2019-12-27 21:12:25,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:25,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128251721] [2019-12-27 21:12:25,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:25,668 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 21:12:25,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128251721] [2019-12-27 21:12:25,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:25,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:12:25,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794225178] [2019-12-27 21:12:25,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:25,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:25,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:12:25,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:25,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:12:25,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:25,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:25,795 INFO L87 Difference]: Start difference. First operand 1347 states and 2871 transitions. Second operand 8 states. [2019-12-27 21:12:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:26,610 INFO L93 Difference]: Finished difference Result 2150 states and 4509 transitions. [2019-12-27 21:12:26,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:12:26,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 21:12:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:26,615 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 21:12:26,615 INFO L226 Difference]: Without dead ends: 2150 [2019-12-27 21:12:26,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 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 21:12:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-12-27 21:12:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1941. [2019-12-27 21:12:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-12-27 21:12:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4107 transitions. [2019-12-27 21:12:26,659 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4107 transitions. Word has length 27 [2019-12-27 21:12:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:26,660 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 4107 transitions. [2019-12-27 21:12:26,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4107 transitions. [2019-12-27 21:12:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:12:26,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:26,665 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 21:12:26,665 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash -374854062, now seen corresponding path program 1 times [2019-12-27 21:12:26,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:26,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353606220] [2019-12-27 21:12:26,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:26,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353606220] [2019-12-27 21:12:26,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:26,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:26,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273803036] [2019-12-27 21:12:26,729 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:26,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:26,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:12:26,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:26,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:12:26,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:26,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:26,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:26,768 INFO L87 Difference]: Start difference. First operand 1941 states and 4107 transitions. Second operand 5 states. [2019-12-27 21:12:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:26,788 INFO L93 Difference]: Finished difference Result 1087 states and 2170 transitions. [2019-12-27 21:12:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:12:26,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:12:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:26,791 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 21:12:26,791 INFO L226 Difference]: Without dead ends: 981 [2019-12-27 21:12:26,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:12:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-27 21:12:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 909. [2019-12-27 21:12:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 21:12:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1885 transitions. [2019-12-27 21:12:26,809 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1885 transitions. Word has length 28 [2019-12-27 21:12:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1885 transitions. [2019-12-27 21:12:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1885 transitions. [2019-12-27 21:12:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:26,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:26,813 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] [2019-12-27 21:12:26,813 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1671814948, now seen corresponding path program 1 times [2019-12-27 21:12:26,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:26,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089615150] [2019-12-27 21:12:26,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:26,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089615150] [2019-12-27 21:12:26,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:26,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:26,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35785020] [2019-12-27 21:12:26,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:26,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:26,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:12:26,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:27,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:27,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:12:27,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:12:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:27,045 INFO L87 Difference]: Start difference. First operand 909 states and 1885 transitions. Second operand 9 states. [2019-12-27 21:12:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:27,335 INFO L93 Difference]: Finished difference Result 1569 states and 3170 transitions. [2019-12-27 21:12:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:12:27,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:12:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:27,340 INFO L225 Difference]: With dead ends: 1569 [2019-12-27 21:12:27,340 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 21:12:27,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:12:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 21:12:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 907. [2019-12-27 21:12:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 21:12:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1857 transitions. [2019-12-27 21:12:27,359 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1857 transitions. Word has length 51 [2019-12-27 21:12:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:27,359 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1857 transitions. [2019-12-27 21:12:27,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:12:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1857 transitions. [2019-12-27 21:12:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:27,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:27,362 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] [2019-12-27 21:12:27,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1673779650, now seen corresponding path program 2 times [2019-12-27 21:12:27,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:27,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614047321] [2019-12-27 21:12:27,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:27,441 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 21:12:27,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614047321] [2019-12-27 21:12:27,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:27,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:27,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17395061] [2019-12-27 21:12:27,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:27,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:27,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 21:12:27,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:27,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:12:27,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:27,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:27,555 INFO L87 Difference]: Start difference. First operand 907 states and 1857 transitions. Second operand 3 states. [2019-12-27 21:12:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:27,615 INFO L93 Difference]: Finished difference Result 1145 states and 2342 transitions. [2019-12-27 21:12:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:27,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:12:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:27,618 INFO L225 Difference]: With dead ends: 1145 [2019-12-27 21:12:27,618 INFO L226 Difference]: Without dead ends: 1145 [2019-12-27 21:12:27,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 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 21:12:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-27 21:12:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 931. [2019-12-27 21:12:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 21:12:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-27 21:12:27,637 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-27 21:12:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:27,637 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-27 21:12:27,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-27 21:12:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:27,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:27,640 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] [2019-12-27 21:12:27,641 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash 187010410, now seen corresponding path program 1 times [2019-12-27 21:12:27,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:27,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744723811] [2019-12-27 21:12:27,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:27,746 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 21:12:27,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744723811] [2019-12-27 21:12:27,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:27,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:12:27,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334061822] [2019-12-27 21:12:27,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:27,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:27,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 194 transitions. [2019-12-27 21:12:27,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:27,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:27,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:27,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:27,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:27,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:27,906 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 8 states. [2019-12-27 21:12:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:28,665 INFO L93 Difference]: Finished difference Result 1141 states and 2310 transitions. [2019-12-27 21:12:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:12:28,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:12:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:28,667 INFO L225 Difference]: With dead ends: 1141 [2019-12-27 21:12:28,667 INFO L226 Difference]: Without dead ends: 1141 [2019-12-27 21:12:28,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:12:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-12-27 21:12:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1039. [2019-12-27 21:12:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 21:12:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 21:12:28,688 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 21:12:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:28,688 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 21:12:28,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 21:12:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:28,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:28,691 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] [2019-12-27 21:12:28,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 419680803, now seen corresponding path program 1 times [2019-12-27 21:12:28,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:28,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960295980] [2019-12-27 21:12:28,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:28,782 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 21:12:28,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960295980] [2019-12-27 21:12:28,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:28,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:28,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609670304] [2019-12-27 21:12:28,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:28,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:28,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 152 transitions. [2019-12-27 21:12:28,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:28,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:12:28,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:12:28,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:12:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:28,926 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 7 states. [2019-12-27 21:12:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:29,541 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-27 21:12:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:29,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:12:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:29,547 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 21:12:29,547 INFO L226 Difference]: Without dead ends: 1291 [2019-12-27 21:12:29,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-27 21:12:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-27 21:12:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 21:12:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-27 21:12:29,572 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-27 21:12:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:29,572 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-27 21:12:29,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:12:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-27 21:12:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:29,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:29,575 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] [2019-12-27 21:12:29,576 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1329705586, now seen corresponding path program 2 times [2019-12-27 21:12:29,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:29,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129843948] [2019-12-27 21:12:29,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:29,736 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 21:12:29,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129843948] [2019-12-27 21:12:29,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:29,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:29,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1461499237] [2019-12-27 21:12:29,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:29,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:29,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 132 transitions. [2019-12-27 21:12:29,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:29,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:29,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:29,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:29,866 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-27 21:12:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:29,879 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-27 21:12:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:29,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:12:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:29,881 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 21:12:29,881 INFO L226 Difference]: Without dead ends: 1075 [2019-12-27 21:12:29,882 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 21:12:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-27 21:12:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-27 21:12:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 21:12:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-27 21:12:29,897 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-27 21:12:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:29,898 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-27 21:12:29,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-27 21:12:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:12:29,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:29,901 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] [2019-12-27 21:12:29,901 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 821444371, now seen corresponding path program 1 times [2019-12-27 21:12:29,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:29,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770584898] [2019-12-27 21:12:29,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:30,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:12:30,005 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:12:30,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1093~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_24 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~z$r_buff1_thd2~0_49) (= |v_ULTIMATE.start_main_~#t1093~0.offset_17| 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1093~0.base_22|) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_9) (= 0 v_~z$r_buff1_thd1~0_20) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1093~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1093~0.base_22|) |v_ULTIMATE.start_main_~#t1093~0.offset_17| 0)) |v_#memory_int_9|) (= v_~x~0_18 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_22|)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd0~0_27) (= v_~z$r_buff0_thd2~0_78 0) (= 0 v_~z$w_buff1_used~0_65) (= v_~z$r_buff0_thd1~0_28 0) (= 0 |v_#NULL.base_5|) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_22| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_23, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, #length=|v_#length_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:12:30,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-12-27 21:12:30,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~z$r_buff0_thd0~0_In638991420 ~z$r_buff1_thd0~0_Out638991420) (= ~x~0_Out638991420 1) (= 1 ~z$r_buff0_thd1~0_Out638991420) (= ~z$r_buff0_thd1~0_In638991420 ~z$r_buff1_thd1~0_Out638991420) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In638991420)) (= ~z$r_buff1_thd2~0_Out638991420 ~z$r_buff0_thd2~0_In638991420)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638991420, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In638991420, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In638991420, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In638991420} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638991420, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out638991420, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out638991420, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out638991420, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In638991420, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out638991420, ~x~0=~x~0_Out638991420, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In638991420} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:12:30,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1990779891 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1990779891 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1990779891| ~z$w_buff0_used~0_In1990779891)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1990779891| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1990779891, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1990779891} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1990779891|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1990779891, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1990779891} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:12:30,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In1968725854 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1968725854 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1968725854 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1968725854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1968725854| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1968725854 |P0Thread1of1ForFork0_#t~ite6_Out1968725854|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1968725854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1968725854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1968725854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1968725854} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1968725854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1968725854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1968725854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1968725854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1968725854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:12:30,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1814668510 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1814668510 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1814668510) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1814668510 ~z$r_buff0_thd1~0_Out1814668510)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1814668510, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1814668510} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1814668510, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1814668510|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1814668510} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:12:30,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1739227604 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1739227604 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1739227604 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1739227604 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1739227604| ~z$r_buff1_thd1~0_In-1739227604) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1739227604| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739227604, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1739227604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1739227604, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1739227604} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739227604, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1739227604|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1739227604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1739227604, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1739227604} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:12:30,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_16)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:12:30,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd2~0_53 v_~z$r_buff0_thd2~0_52)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_53} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:12:30,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L773-->L773-8: Formula: (let ((.cse3 (= |P1Thread1of1ForFork1_#t~ite30_Out-844846917| |P1Thread1of1ForFork1_#t~ite29_Out-844846917|)) (.cse5 (= 0 (mod ~z$r_buff1_thd2~0_In-844846917 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-844846917 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd2~0_In-844846917 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-844846917 256) 0)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-844846917 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-844846917| |P1Thread1of1ForFork1_#t~ite29_Out-844846917|) (or (not .cse1) .cse2) .cse3 .cse4 (= |P1Thread1of1ForFork1_#t~ite28_Out-844846917| 0) (or (not .cse5) .cse2))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-844846917| ~z$r_buff1_thd2~0_In-844846917) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite29_In-844846917| |P1Thread1of1ForFork1_#t~ite29_Out-844846917|)) (and (= ~z$r_buff1_thd2~0_In-844846917 |P1Thread1of1ForFork1_#t~ite29_Out-844846917|) .cse3 (or (and .cse6 .cse5) (and .cse1 .cse6) .cse0) .cse4)) (= |P1Thread1of1ForFork1_#t~ite28_In-844846917| |P1Thread1of1ForFork1_#t~ite28_Out-844846917|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-844846917|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-844846917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-844846917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-844846917, ~weak$$choice2~0=~weak$$choice2~0_In-844846917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-844846917, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-844846917|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-844846917|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-844846917|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-844846917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-844846917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-844846917, ~weak$$choice2~0=~weak$$choice2~0_In-844846917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-844846917, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-844846917|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:12:30,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:12:30,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In302730509 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In302730509 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In302730509 |P1Thread1of1ForFork1_#t~ite32_Out302730509|) (not .cse1)) (and (= ~z~0_In302730509 |P1Thread1of1ForFork1_#t~ite32_Out302730509|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In302730509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302730509, ~z$w_buff1~0=~z$w_buff1~0_In302730509, ~z~0=~z~0_In302730509} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In302730509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302730509, ~z$w_buff1~0=~z$w_buff1~0_In302730509, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out302730509|, ~z~0=~z~0_In302730509} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:12:30,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 21:12:30,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In773864289 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In773864289 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out773864289|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out773864289| ~z$w_buff0_used~0_In773864289)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In773864289, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In773864289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In773864289, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out773864289|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In773864289} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:12:30,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1525551573 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1525551573 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1525551573 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1525551573 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1525551573 |P1Thread1of1ForFork1_#t~ite35_Out-1525551573|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1525551573|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525551573, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1525551573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525551573, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1525551573} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525551573, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1525551573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525551573, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1525551573|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1525551573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:12:30,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1646426484 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1646426484 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1646426484| ~z$r_buff0_thd2~0_In-1646426484)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1646426484| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1646426484, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1646426484} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1646426484, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1646426484, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1646426484|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:12:30,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-23180838 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-23180838 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-23180838 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-23180838 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-23180838| 0)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-23180838 |P1Thread1of1ForFork1_#t~ite37_Out-23180838|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-23180838, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-23180838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23180838, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-23180838} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-23180838, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-23180838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23180838, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-23180838, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-23180838|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:30,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:30,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 21:12:30,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite40_Out2145245243| |ULTIMATE.start_main_#t~ite41_Out2145245243|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2145245243 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2145245243 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out2145245243| ~z~0_In2145245243) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2145245243| ~z$w_buff1~0_In2145245243)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2145245243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2145245243, ~z$w_buff1~0=~z$w_buff1~0_In2145245243, ~z~0=~z~0_In2145245243} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2145245243|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2145245243|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2145245243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2145245243, ~z$w_buff1~0=~z$w_buff1~0_In2145245243, ~z~0=~z~0_In2145245243} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:12:30,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2112984690 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2112984690 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-2112984690| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2112984690 |ULTIMATE.start_main_#t~ite42_Out-2112984690|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112984690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112984690} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112984690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112984690, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2112984690|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:12:30,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In720324502 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In720324502 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In720324502 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In720324502 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out720324502| ~z$w_buff1_used~0_In720324502) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out720324502| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In720324502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In720324502, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In720324502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In720324502} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In720324502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In720324502, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In720324502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In720324502, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out720324502|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:12:30,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1680089819 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1680089819 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1680089819| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1680089819| ~z$r_buff0_thd0~0_In1680089819)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1680089819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1680089819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1680089819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1680089819, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1680089819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:12:30,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-809658966 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-809658966 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-809658966 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-809658966 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-809658966|)) (and (= ~z$r_buff1_thd0~0_In-809658966 |ULTIMATE.start_main_#t~ite45_Out-809658966|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-809658966, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-809658966, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-809658966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-809658966} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-809658966, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-809658966, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-809658966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-809658966, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-809658966|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:12:30,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_19) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:12:30,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:12:30 BasicIcfg [2019-12-27 21:12:30,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:12:30,104 INFO L168 Benchmark]: Toolchain (without parser) took 13700.59 ms. Allocated memory was 137.4 MB in the beginning and 463.5 MB in the end (delta: 326.1 MB). Free memory was 99.3 MB in the beginning and 302.4 MB in the end (delta: -203.2 MB). Peak memory consumption was 123.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,105 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.90 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 156.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,107 INFO L168 Benchmark]: Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,107 INFO L168 Benchmark]: RCFGBuilder took 787.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,108 INFO L168 Benchmark]: TraceAbstraction took 12062.01 ms. Allocated memory was 202.4 MB in the beginning and 463.5 MB in the end (delta: 261.1 MB). Free memory was 107.0 MB in the beginning and 302.4 MB in the end (delta: -195.4 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:30,112 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.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.90 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 156.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.54 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12062.01 ms. Allocated memory was 202.4 MB in the beginning and 463.5 MB in the end (delta: 261.1 MB). Free memory was 107.0 MB in the beginning and 302.4 MB in the end (delta: -195.4 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 4431 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49804 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L740] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L740] 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) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 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 = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L779] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 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 [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L813] 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 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2020 SDtfs, 1451 SDslu, 4322 SDs, 0 SdLazy, 2579 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 16 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 3058 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 48903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...