/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:56:48,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:56:48,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:56:48,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:56:48,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:56:48,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:56:48,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:56:48,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:56:48,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:56:48,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:56:48,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:56:48,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:56:48,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:56:48,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:56:48,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:56:48,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:56:48,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:56:48,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:56:48,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:56:48,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:56:48,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:56:48,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:56:48,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:56:48,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:56:48,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:56:48,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:56:48,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:56:48,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:56:48,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:56:48,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:56:48,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:56:48,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:56:48,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:56:48,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:56:48,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:56:48,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:56:48,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:56:48,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:56:48,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:56:48,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:56:48,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:56:48,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-SemanticLbe-MCR.epf [2019-12-27 16:56:48,201 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:56:48,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:56:48,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:56:48,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:56:48,205 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:56:48,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:56:48,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:56:48,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:56:48,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:56:48,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:56:48,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:56:48,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:56:48,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:56:48,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:56:48,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:56:48,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:56:48,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:56:48,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:56:48,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:56:48,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:56:48,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:56:48,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:56:48,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:56:48,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:56:48,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:56:48,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:56:48,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:56:48,210 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:56:48,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:56:48,211 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:56:48,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:56:48,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:56:48,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:56:48,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:56:48,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:56:48,512 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:56:48,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 16:56:48,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36062baf6/1ef111541ad04e4f91285978909b8b28/FLAG2ed8e64cc [2019-12-27 16:56:49,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:56:49,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_power.opt.i [2019-12-27 16:56:49,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36062baf6/1ef111541ad04e4f91285978909b8b28/FLAG2ed8e64cc [2019-12-27 16:56:49,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36062baf6/1ef111541ad04e4f91285978909b8b28 [2019-12-27 16:56:49,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:56:49,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:56:49,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:56:49,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:56:49,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:56:49,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:56:49" (1/1) ... [2019-12-27 16:56:49,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9a81ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:49, skipping insertion in model container [2019-12-27 16:56:49,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:56:49" (1/1) ... [2019-12-27 16:56:49,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:56:49,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:56:50,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:56:50,034 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:56:50,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:56:50,192 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:56:50,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50 WrapperNode [2019-12-27 16:56:50,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:56:50,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:56:50,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:56:50,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:56:50,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:56:50,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:56:50,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:56:50,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:56:50,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... [2019-12-27 16:56:50,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:56:50,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:56:50,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:56:50,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:56:50,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:56:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:56:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:56:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:56:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:56:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:56:50,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:56:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:56:50,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:56:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:56:50,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:56:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:56:50,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:56:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:56:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:56:50,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:56:50,376 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 16:56:51,121 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:56:51,121 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:56:51,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:56:51 BoogieIcfgContainer [2019-12-27 16:56:51,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:56:51,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:56:51,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:56:51,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:56:51,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:56:49" (1/3) ... [2019-12-27 16:56:51,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fee2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:56:51, skipping insertion in model container [2019-12-27 16:56:51,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:56:50" (2/3) ... [2019-12-27 16:56:51,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fee2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:56:51, skipping insertion in model container [2019-12-27 16:56:51,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:56:51" (3/3) ... [2019-12-27 16:56:51,132 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_power.opt.i [2019-12-27 16:56:51,143 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:56:51,143 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:56:51,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:56:51,154 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:56:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,197 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,224 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,224 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,225 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,225 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,225 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,263 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,263 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,263 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,264 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,265 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,265 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,265 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:56:51,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:56:51,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:56:51,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:56:51,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:56:51,301 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:56:51,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:56:51,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:56:51,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:56:51,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:56:51,320 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 16:56:51,322 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:56:51,419 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:56:51,419 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:56:51,435 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:56:51,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:56:51,505 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:56:51,506 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:56:51,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:56:51,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 16:56:51,529 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:56:56,021 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 16:56:56,416 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:56:56,546 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:56:57,060 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 16:56:57,210 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 16:56:57,232 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 16:56:57,232 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 16:56:57,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 16:56:58,494 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 16:56:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 16:56:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:56:58,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:58,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:58,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 16:56:58,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:58,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093641705] [2019-12-27 16:56:58,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:58,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 16:56:58,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093641705] [2019-12-27 16:56:58,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:58,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:56:58,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031662176] [2019-12-27 16:56:58,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:58,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:58,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:56:58,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:58,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:58,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:58,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:58,836 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 16:56:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:59,391 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 16:56:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:59,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:56:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:59,669 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 16:56:59,669 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 16:56:59,670 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 16:57:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 16:57:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 16:57:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 16:57:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 16:57:01,713 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 16:57:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:01,714 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 16:57:01,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 16:57:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:57:01,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:01,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:01,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 16:57:01,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:01,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817965274] [2019-12-27 16:57:01,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:01,910 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 16:57:01,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817965274] [2019-12-27 16:57:01,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:01,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:01,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065753640] [2019-12-27 16:57:01,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:01,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:01,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:57:01,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:01,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:01,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:57:01,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:57:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:57:01,923 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 16:57:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:02,460 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 16:57:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:57:02,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:57:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:02,620 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 16:57:02,620 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 16:57:02,621 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 16:57:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 16:57:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 16:57:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 16:57:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 16:57:05,044 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 16:57:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:05,044 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 16:57:05,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:57:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 16:57:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:57:05,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:05,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:05,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:05,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 16:57:05,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:05,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823732391] [2019-12-27 16:57:05,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:05,168 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 16:57:05,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823732391] [2019-12-27 16:57:05,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:05,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:05,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810081228] [2019-12-27 16:57:05,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:05,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:05,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 16:57:05,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:05,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:57:05,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:57:05,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:57:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:05,220 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 5 states. [2019-12-27 16:57:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:05,605 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 16:57:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:57:05,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 16:57:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:05,786 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 16:57:05,787 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 16:57:05,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:57:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 16:57:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 16:57:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 16:57:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 16:57:07,445 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 16:57:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:07,445 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 16:57:07,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:57:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 16:57:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 16:57:07,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:07,463 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] [2019-12-27 16:57:07,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:07,463 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 16:57:07,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:07,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506114909] [2019-12-27 16:57:07,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:07,558 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 16:57:07,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506114909] [2019-12-27 16:57:07,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:07,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:57:07,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121059025] [2019-12-27 16:57:07,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:07,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:07,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 16:57:07,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:07,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:07,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:07,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:07,574 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 16:57:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:09,127 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-27 16:57:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:09,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 16:57:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:09,219 INFO L225 Difference]: With dead ends: 30328 [2019-12-27 16:57:09,219 INFO L226 Difference]: Without dead ends: 30328 [2019-12-27 16:57:09,220 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 16:57:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-27 16:57:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-27 16:57:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-27 16:57:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-27 16:57:10,312 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-27 16:57:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:10,312 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-27 16:57:10,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-27 16:57:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:57:10,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:10,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:10,326 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 16:57:10,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:10,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655186210] [2019-12-27 16:57:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:10,394 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 16:57:10,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655186210] [2019-12-27 16:57:10,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:10,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:10,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120377680] [2019-12-27 16:57:10,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:10,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:10,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 16:57:10,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:10,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:10,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:10,405 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-27 16:57:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:10,630 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-27 16:57:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:10,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:57:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:10,706 INFO L225 Difference]: With dead ends: 44924 [2019-12-27 16:57:10,706 INFO L226 Difference]: Without dead ends: 32296 [2019-12-27 16:57:10,707 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 16:57:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-27 16:57:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-27 16:57:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-27 16:57:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-27 16:57:11,682 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-27 16:57:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:11,682 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-27 16:57:11,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-27 16:57:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:57:11,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:11,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:11,694 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-27 16:57:11,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:11,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466328470] [2019-12-27 16:57:11,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:11,760 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 16:57:11,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466328470] [2019-12-27 16:57:11,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:11,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:57:11,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675022398] [2019-12-27 16:57:11,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:11,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:11,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 36 transitions. [2019-12-27 16:57:11,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:11,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:11,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:11,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:11,774 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-27 16:57:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:11,944 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-27 16:57:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:11,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:57:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:12,010 INFO L225 Difference]: With dead ends: 30604 [2019-12-27 16:57:12,010 INFO L226 Difference]: Without dead ends: 30604 [2019-12-27 16:57:12,010 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 16:57:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-27 16:57:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-27 16:57:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-27 16:57:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-27 16:57:12,864 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-27 16:57:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:12,865 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-27 16:57:12,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-27 16:57:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:57:12,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:12,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:12,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-27 16:57:12,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:12,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256608042] [2019-12-27 16:57:12,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:12,946 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 16:57:12,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256608042] [2019-12-27 16:57:12,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:12,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:12,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415942436] [2019-12-27 16:57:12,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:12,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:12,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 16:57:12,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:12,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:57:12,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:57:12,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:57:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:57:12,975 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 4 states. [2019-12-27 16:57:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:13,169 INFO L93 Difference]: Finished difference Result 30436 states and 112751 transitions. [2019-12-27 16:57:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:57:13,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 16:57:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:13,234 INFO L225 Difference]: With dead ends: 30436 [2019-12-27 16:57:13,234 INFO L226 Difference]: Without dead ends: 30436 [2019-12-27 16:57:13,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30436 states. [2019-12-27 16:57:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30436 to 30036. [2019-12-27 16:57:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30036 states. [2019-12-27 16:57:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30036 states to 30036 states and 111391 transitions. [2019-12-27 16:57:14,053 INFO L78 Accepts]: Start accepts. Automaton has 30036 states and 111391 transitions. Word has length 22 [2019-12-27 16:57:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:14,054 INFO L462 AbstractCegarLoop]: Abstraction has 30036 states and 111391 transitions. [2019-12-27 16:57:14,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:57:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 30036 states and 111391 transitions. [2019-12-27 16:57:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 16:57:14,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:14,066 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] [2019-12-27 16:57:14,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:14,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:14,067 INFO L82 PathProgramCache]: Analyzing trace with hash -428330177, now seen corresponding path program 1 times [2019-12-27 16:57:14,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:14,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179379493] [2019-12-27 16:57:14,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:14,127 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 16:57:14,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179379493] [2019-12-27 16:57:14,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:14,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:14,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534652284] [2019-12-27 16:57:14,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:14,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:14,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 52 transitions. [2019-12-27 16:57:14,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:57:14,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:57:14,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:57:14,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:57:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:57:14,189 INFO L87 Difference]: Start difference. First operand 30036 states and 111391 transitions. Second operand 7 states. [2019-12-27 16:57:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:14,658 INFO L93 Difference]: Finished difference Result 40203 states and 141628 transitions. [2019-12-27 16:57:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:57:14,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 16:57:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:14,738 INFO L225 Difference]: With dead ends: 40203 [2019-12-27 16:57:14,738 INFO L226 Difference]: Without dead ends: 38413 [2019-12-27 16:57:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:57:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38413 states. [2019-12-27 16:57:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38413 to 23877. [2019-12-27 16:57:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23877 states. [2019-12-27 16:57:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23877 states to 23877 states and 83947 transitions. [2019-12-27 16:57:15,505 INFO L78 Accepts]: Start accepts. Automaton has 23877 states and 83947 transitions. Word has length 23 [2019-12-27 16:57:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:15,506 INFO L462 AbstractCegarLoop]: Abstraction has 23877 states and 83947 transitions. [2019-12-27 16:57:15,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:57:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23877 states and 83947 transitions. [2019-12-27 16:57:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:57:15,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:15,515 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] [2019-12-27 16:57:15,515 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:15,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1442998109, now seen corresponding path program 1 times [2019-12-27 16:57:15,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:15,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879706249] [2019-12-27 16:57:15,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:15,570 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 16:57:15,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879706249] [2019-12-27 16:57:15,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:15,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:15,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727029214] [2019-12-27 16:57:15,571 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:15,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:15,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 78 transitions. [2019-12-27 16:57:15,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:15,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:57:15,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:57:15,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:57:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:57:15,587 INFO L87 Difference]: Start difference. First operand 23877 states and 83947 transitions. Second operand 4 states. [2019-12-27 16:57:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:15,763 INFO L93 Difference]: Finished difference Result 34038 states and 116336 transitions. [2019-12-27 16:57:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:57:15,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 16:57:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:15,804 INFO L225 Difference]: With dead ends: 34038 [2019-12-27 16:57:15,804 INFO L226 Difference]: Without dead ends: 21154 [2019-12-27 16:57:15,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:57:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21154 states. [2019-12-27 16:57:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21154 to 20871. [2019-12-27 16:57:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-27 16:57:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-27 16:57:16,487 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 24 [2019-12-27 16:57:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:16,487 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-27 16:57:16,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:57:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-27 16:57:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:57:16,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:16,497 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] [2019-12-27 16:57:16,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-27 16:57:16,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:16,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754984695] [2019-12-27 16:57:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:16,572 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 16:57:16,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754984695] [2019-12-27 16:57:16,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:16,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:57:16,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103757199] [2019-12-27 16:57:16,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:16,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:16,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 16:57:16,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:16,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:57:16,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:57:16,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:57:16,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:57:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:57:16,640 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 8 states. [2019-12-27 16:57:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:16,959 INFO L93 Difference]: Finished difference Result 13500 states and 42056 transitions. [2019-12-27 16:57:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:57:16,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:57:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:16,977 INFO L225 Difference]: With dead ends: 13500 [2019-12-27 16:57:16,978 INFO L226 Difference]: Without dead ends: 12183 [2019-12-27 16:57:16,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12183 states. [2019-12-27 16:57:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12183 to 8268. [2019-12-27 16:57:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-27 16:57:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-27 16:57:17,134 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-27 16:57:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:17,134 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-27 16:57:17,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:57:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-27 16:57:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:57:17,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:17,138 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 16:57:17,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-27 16:57:17,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:17,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77271501] [2019-12-27 16:57:17,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:17,181 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 16:57:17,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77271501] [2019-12-27 16:57:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:17,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:17,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756952884] [2019-12-27 16:57:17,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:17,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:17,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 62 transitions. [2019-12-27 16:57:17,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:17,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:57:17,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:57:17,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:57:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:57:17,200 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-27 16:57:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:17,274 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-27 16:57:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:57:17,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:57:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:17,289 INFO L225 Difference]: With dead ends: 12230 [2019-12-27 16:57:17,289 INFO L226 Difference]: Without dead ends: 7682 [2019-12-27 16:57:17,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 16:57:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-27 16:57:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-27 16:57:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-27 16:57:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-27 16:57:17,419 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-27 16:57:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:17,419 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-27 16:57:17,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:57:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-27 16:57:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:57:17,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:17,423 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 16:57:17,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-27 16:57:17,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:17,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570353681] [2019-12-27 16:57:17,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:17,525 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 16:57:17,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570353681] [2019-12-27 16:57:17,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:17,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:57:17,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330097315] [2019-12-27 16:57:17,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:17,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:17,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 42 transitions. [2019-12-27 16:57:17,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:17,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:57:17,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:57:17,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:57:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:57:17,540 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-27 16:57:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:17,630 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-27 16:57:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:57:17,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:57:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:17,635 INFO L225 Difference]: With dead ends: 2913 [2019-12-27 16:57:17,635 INFO L226 Difference]: Without dead ends: 2472 [2019-12-27 16:57:17,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:57:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-27 16:57:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-27 16:57:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-27 16:57:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-27 16:57:17,670 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-27 16:57:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:17,671 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-27 16:57:17,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:57:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-27 16:57:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:57:17,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:17,675 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] [2019-12-27 16:57:17,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 16:57:17,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:17,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438637036] [2019-12-27 16:57:17,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:17,717 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 16:57:17,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438637036] [2019-12-27 16:57:17,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:17,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:57:17,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444834518] [2019-12-27 16:57:17,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:17,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:17,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 16:57:17,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:17,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:57:17,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:57:17,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:57:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:17,855 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 5 states. [2019-12-27 16:57:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:17,964 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-27 16:57:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:17,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:57:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:17,971 INFO L225 Difference]: With dead ends: 3752 [2019-12-27 16:57:17,972 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 16:57:17,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:57:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 16:57:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-27 16:57:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-27 16:57:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-27 16:57:18,028 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-27 16:57:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:18,028 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-27 16:57:18,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:57:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-27 16:57:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:57:18,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:18,033 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] [2019-12-27 16:57:18,033 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 16:57:18,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:18,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535845226] [2019-12-27 16:57:18,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:18,122 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 16:57:18,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535845226] [2019-12-27 16:57:18,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:18,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:57:18,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154618191] [2019-12-27 16:57:18,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:18,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:18,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 16:57:18,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:18,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:57:18,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:57:18,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:57:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:57:18,252 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 8 states. [2019-12-27 16:57:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:18,686 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-27 16:57:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:57:18,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 16:57:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:18,693 INFO L225 Difference]: With dead ends: 5425 [2019-12-27 16:57:18,694 INFO L226 Difference]: Without dead ends: 5242 [2019-12-27 16:57:18,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:57:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-27 16:57:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-27 16:57:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-27 16:57:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-27 16:57:18,750 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-27 16:57:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:18,750 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-27 16:57:18,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:57:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-27 16:57:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:57:18,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:18,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:18,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 16:57:18,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:18,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387076485] [2019-12-27 16:57:18,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:18,872 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 16:57:18,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387076485] [2019-12-27 16:57:18,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:18,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:57:18,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648330674] [2019-12-27 16:57:18,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:18,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:18,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 357 transitions. [2019-12-27 16:57:18,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:19,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:57:19,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:57:19,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:57:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:57:19,001 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 8 states. [2019-12-27 16:57:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:19,497 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-27 16:57:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:57:19,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:57:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:19,504 INFO L225 Difference]: With dead ends: 5331 [2019-12-27 16:57:19,504 INFO L226 Difference]: Without dead ends: 5133 [2019-12-27 16:57:19,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:57:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-27 16:57:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-27 16:57:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-27 16:57:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-27 16:57:19,567 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-27 16:57:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-27 16:57:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:57:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-27 16:57:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:57:19,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:19,573 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] [2019-12-27 16:57:19,573 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-27 16:57:19,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:19,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768853656] [2019-12-27 16:57:19,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:19,688 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 16:57:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768853656] [2019-12-27 16:57:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:19,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:57:19,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083768264] [2019-12-27 16:57:19,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:19,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:19,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 119 transitions. [2019-12-27 16:57:19,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:19,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:57:19,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:57:19,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:57:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:57:19,756 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 8 states. [2019-12-27 16:57:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:19,971 INFO L93 Difference]: Finished difference Result 2177 states and 5525 transitions. [2019-12-27 16:57:19,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:57:19,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 16:57:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:19,972 INFO L225 Difference]: With dead ends: 2177 [2019-12-27 16:57:19,972 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 16:57:19,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:57:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 16:57:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 470. [2019-12-27 16:57:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-27 16:57:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-27 16:57:19,981 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-27 16:57:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:19,981 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-27 16:57:19,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:57:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-27 16:57:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:57:19,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:19,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:19,983 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-27 16:57:19,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:19,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295177739] [2019-12-27 16:57:19,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:20,068 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 16:57:20,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295177739] [2019-12-27 16:57:20,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:20,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:57:20,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134288092] [2019-12-27 16:57:20,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:20,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:20,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 269 transitions. [2019-12-27 16:57:20,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:20,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:57:20,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:57:20,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:57:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:57:20,222 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-27 16:57:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:20,376 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-27 16:57:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:57:20,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 16:57:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:20,377 INFO L225 Difference]: With dead ends: 892 [2019-12-27 16:57:20,377 INFO L226 Difference]: Without dead ends: 594 [2019-12-27 16:57:20,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:57:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-27 16:57:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-27 16:57:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 16:57:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-27 16:57:20,385 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-27 16:57:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:20,386 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-27 16:57:20,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:57:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-27 16:57:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:57:20,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:20,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:20,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-27 16:57:20,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30146662] [2019-12-27 16:57:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:20,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:57:20,552 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:57:20,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:57:20,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-27 16:57:20,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:57:20,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-27 16:57:20,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In61684512 ~z$r_buff1_thd1~0_Out61684512) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In61684512)) (= ~z$r_buff0_thd4~0_Out61684512 1) (= ~__unbuffered_p3_EAX~0_Out61684512 ~a~0_Out61684512) (= 1 ~a~0_Out61684512) (= ~z$r_buff0_thd0~0_In61684512 ~z$r_buff1_thd0~0_Out61684512) (= ~b~0_In61684512 ~__unbuffered_p3_EBX~0_Out61684512) (= ~z$r_buff1_thd4~0_Out61684512 ~z$r_buff0_thd4~0_In61684512) (= ~z$r_buff1_thd2~0_Out61684512 ~z$r_buff0_thd2~0_In61684512) (= ~z$r_buff0_thd3~0_In61684512 ~z$r_buff1_thd3~0_Out61684512)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In61684512, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In61684512, ~b~0=~b~0_In61684512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In61684512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In61684512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In61684512, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In61684512} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In61684512, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out61684512, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out61684512, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out61684512, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out61684512, ~a~0=~a~0_Out61684512, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In61684512, ~b~0=~b~0_In61684512, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out61684512, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out61684512, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out61684512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out61684512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In61684512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In61684512, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In61684512} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 16:57:20,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 16:57:20,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 16:57:20,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-441646162 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In-441646162| |P2Thread1of1ForFork1_#t~ite8_Out-441646162|) (not .cse0) (= ~z$w_buff0~0_In-441646162 |P2Thread1of1ForFork1_#t~ite9_Out-441646162|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out-441646162| ~z$w_buff0~0_In-441646162) (= |P2Thread1of1ForFork1_#t~ite8_Out-441646162| |P2Thread1of1ForFork1_#t~ite9_Out-441646162|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-441646162 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-441646162 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In-441646162 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-441646162 256) 0)))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-441646162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441646162, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-441646162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-441646162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-441646162, ~weak$$choice2~0=~weak$$choice2~0_In-441646162, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-441646162|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-441646162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441646162, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-441646162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-441646162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-441646162, ~weak$$choice2~0=~weak$$choice2~0_In-441646162, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-441646162|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-441646162|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:57:20,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In570647192 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In570647192 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In570647192 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In570647192 256)) (and (= 0 (mod ~z$w_buff1_used~0_In570647192 256)) .cse0))) (= |P2Thread1of1ForFork1_#t~ite12_Out570647192| |P2Thread1of1ForFork1_#t~ite11_Out570647192|) .cse1 (= ~z$w_buff1~0_In570647192 |P2Thread1of1ForFork1_#t~ite11_Out570647192|)) (and (= |P2Thread1of1ForFork1_#t~ite11_In570647192| |P2Thread1of1ForFork1_#t~ite11_Out570647192|) (= |P2Thread1of1ForFork1_#t~ite12_Out570647192| ~z$w_buff1~0_In570647192) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In570647192, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In570647192, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In570647192|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In570647192, ~z$w_buff1~0=~z$w_buff1~0_In570647192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In570647192, ~weak$$choice2~0=~weak$$choice2~0_In570647192} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In570647192, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out570647192|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In570647192, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out570647192|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In570647192, ~z$w_buff1~0=~z$w_buff1~0_In570647192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In570647192, ~weak$$choice2~0=~weak$$choice2~0_In570647192} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:57:20,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-608829729 256) 0))) (or (and (= ~z$w_buff0_used~0_In-608829729 |P2Thread1of1ForFork1_#t~ite15_Out-608829729|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In-608829729| |P2Thread1of1ForFork1_#t~ite14_Out-608829729|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-608829729 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-608829729 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-608829729 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-608829729 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out-608829729| ~z$w_buff0_used~0_In-608829729) .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out-608829729| |P2Thread1of1ForFork1_#t~ite15_Out-608829729|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-608829729|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-608829729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-608829729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-608829729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-608829729, ~weak$$choice2~0=~weak$$choice2~0_In-608829729} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-608829729|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-608829729|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-608829729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-608829729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-608829729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-608829729, ~weak$$choice2~0=~weak$$choice2~0_In-608829729} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 16:57:20,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 16:57:20,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2125545035 256)))) (or (and (= ~z$r_buff1_thd3~0_In2125545035 |P2Thread1of1ForFork1_#t~ite24_Out2125545035|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In2125545035| |P2Thread1of1ForFork1_#t~ite23_Out2125545035|)) (and (= ~z$r_buff1_thd3~0_In2125545035 |P2Thread1of1ForFork1_#t~ite23_Out2125545035|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2125545035 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In2125545035 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In2125545035 256)) (and (= (mod ~z$w_buff1_used~0_In2125545035 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out2125545035| |P2Thread1of1ForFork1_#t~ite24_Out2125545035|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2125545035, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2125545035, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In2125545035|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2125545035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125545035, ~weak$$choice2~0=~weak$$choice2~0_In2125545035} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out2125545035|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2125545035, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2125545035, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out2125545035|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2125545035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125545035, ~weak$$choice2~0=~weak$$choice2~0_In2125545035} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 16:57:20,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:57:20,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1035942494 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1035942494 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1035942494|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1035942494 |P3Thread1of1ForFork2_#t~ite28_Out-1035942494|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035942494, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1035942494} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1035942494|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1035942494, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1035942494} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 16:57:20,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1783832037 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1783832037 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1783832037 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1783832037 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1783832037 |P3Thread1of1ForFork2_#t~ite29_Out-1783832037|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-1783832037|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1783832037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1783832037, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1783832037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1783832037} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1783832037|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1783832037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1783832037, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1783832037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1783832037} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 16:57:20,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1694013226 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1694013226 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-1694013226 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-1694013226 ~z$r_buff0_thd4~0_In-1694013226) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694013226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1694013226} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1694013226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1694013226, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-1694013226|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 16:57:20,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-2095766139 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2095766139 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-2095766139 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2095766139 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-2095766139|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite31_Out-2095766139| ~z$r_buff1_thd4~0_In-2095766139)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2095766139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2095766139, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2095766139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2095766139} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2095766139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2095766139, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2095766139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2095766139, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-2095766139|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:57:20,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:57:20,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:57:20,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-533535857 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-533535857 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite36_Out-533535857| |ULTIMATE.start_main_#t~ite37_Out-533535857|))) (or (and (= ~z~0_In-533535857 |ULTIMATE.start_main_#t~ite36_Out-533535857|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-533535857 |ULTIMATE.start_main_#t~ite36_Out-533535857|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-533535857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533535857, ~z$w_buff1~0=~z$w_buff1~0_In-533535857, ~z~0=~z~0_In-533535857} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-533535857, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533535857, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-533535857|, ~z$w_buff1~0=~z$w_buff1~0_In-533535857, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-533535857|, ~z~0=~z~0_In-533535857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:57:20,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1539696805 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1539696805 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1539696805| ~z$w_buff0_used~0_In-1539696805) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1539696805| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539696805, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539696805} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539696805, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539696805, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1539696805|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:57:20,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1151514905 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1151514905 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1151514905 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1151514905 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1151514905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out1151514905| ~z$w_buff1_used~0_In1151514905) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1151514905, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1151514905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1151514905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1151514905} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1151514905, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1151514905|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1151514905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1151514905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1151514905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:57:20,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-514147411 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-514147411 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-514147411| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-514147411| ~z$r_buff0_thd0~0_In-514147411) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514147411, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514147411} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514147411, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-514147411|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514147411} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:57:20,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1450437073 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1450437073 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1450437073 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1450437073 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1450437073 |ULTIMATE.start_main_#t~ite41_Out1450437073|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out1450437073|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450437073, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450437073, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450437073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450437073} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1450437073|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450437073, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450437073, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450437073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450437073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:57:20,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:57:20,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:57:20 BasicIcfg [2019-12-27 16:57:20,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:57:20,680 INFO L168 Benchmark]: Toolchain (without parser) took 31270.39 ms. Allocated memory was 138.9 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 102.1 MB in the beginning and 789.4 MB in the end (delta: -687.3 MB). Peak memory consumption was 775.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,680 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.41 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,686 INFO L168 Benchmark]: Boogie Preprocessor took 44.64 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.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 16:57:20,686 INFO L168 Benchmark]: RCFGBuilder took 825.09 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 106.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,687 INFO L168 Benchmark]: TraceAbstraction took 29553.45 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.3 MB in the beginning and 789.4 MB in the end (delta: -683.1 MB). Peak memory consumption was 714.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:20,697 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.41 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.64 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.09 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 106.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29553.45 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.3 MB in the beginning and 789.4 MB in the end (delta: -683.1 MB). Peak memory consumption was 714.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 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) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1879 SDtfs, 3710 SDslu, 3270 SDs, 0 SdLazy, 1294 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 34045 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 29991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...