/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:33:22,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:33:22,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:33:22,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:33:22,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:33:22,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:33:22,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:33:22,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:33:22,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:33:22,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:33:22,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:33:22,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:33:22,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:33:22,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:33:22,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:33:22,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:33:22,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:33:22,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:33:22,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:33:22,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:33:22,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:33:22,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:33:22,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:33:22,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:33:22,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:33:22,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:33:22,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:33:22,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:33:22,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:33:22,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:33:22,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:33:22,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:33:22,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:33:22,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:33:22,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:33:22,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:33:22,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:33:22,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:33:22,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:33:22,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:33:22,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:33:22,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:33:22,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:33:22,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:33:22,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:33:22,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:33:22,305 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:33:22,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:33:22,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:33:22,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:33:22,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:33:22,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:33:22,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:33:22,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:33:22,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:33:22,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:33:22,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:33:22,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:33:22,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:33:22,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:33:22,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:33:22,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:33:22,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:33:22,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:33:22,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:33:22,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:33:22,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:33:22,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:33:22,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:33:22,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:33:22,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:33:22,594 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:33:22,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-18 22:33:22,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208cd4652/79dd2af1032a4f168bd3e9a08e943049/FLAG899482879 [2019-12-18 22:33:23,199 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:33:23,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-18 22:33:23,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208cd4652/79dd2af1032a4f168bd3e9a08e943049/FLAG899482879 [2019-12-18 22:33:23,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/208cd4652/79dd2af1032a4f168bd3e9a08e943049 [2019-12-18 22:33:23,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:33:23,522 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:33:23,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:23,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:33:23,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:33:23,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23, skipping insertion in model container [2019-12-18 22:33:23,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:33:23,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:33:24,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:24,195 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:33:24,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:24,339 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:33:24,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24 WrapperNode [2019-12-18 22:33:24,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:24,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:24,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:33:24,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:33:24,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:24,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:33:24,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:33:24,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:33:24,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:33:24,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:33:24,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:33:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:33:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:33:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:33:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:33:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:33:24,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:33:24,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:33:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:33:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:33:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:33:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:33:24,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:33:24,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:33:24,528 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:33:25,288 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:33:25,289 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:33:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:25 BoogieIcfgContainer [2019-12-18 22:33:25,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:33:25,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:33:25,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:33:25,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:33:25,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:33:23" (1/3) ... [2019-12-18 22:33:25,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640fa5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:25, skipping insertion in model container [2019-12-18 22:33:25,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (2/3) ... [2019-12-18 22:33:25,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640fa5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:25, skipping insertion in model container [2019-12-18 22:33:25,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:25" (3/3) ... [2019-12-18 22:33:25,303 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.opt.i [2019-12-18 22:33:25,315 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:33:25,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:33:25,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:33:25,328 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:33:25,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,438 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,438 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,476 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:33:25,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:33:25,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:33:25,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:33:25,497 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:33:25,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:33:25,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:33:25,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:33:25,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:33:25,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:33:25,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,619 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,620 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,643 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:25,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,738 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,739 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:25,764 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:33:25,765 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:33:29,272 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:33:29,399 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:33:29,480 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-18 22:33:29,481 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:33:29,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:33:42,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:33:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:33:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:33:42,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:42,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:33:42,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-18 22:33:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:42,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685676407] [2019-12-18 22:33:42,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:43,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685676407] [2019-12-18 22:33:43,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:43,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:33:43,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604220573] [2019-12-18 22:33:43,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:43,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:43,259 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:33:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:44,367 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:33:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:44,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:33:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:47,502 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:33:47,502 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:33:47,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:33:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:33:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:33:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:33:53,525 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:33:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:53,526 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:33:53,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:33:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:53,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:53,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:53,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-18 22:33:53,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:53,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426468952] [2019-12-18 22:33:53,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:33:53,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426468952] [2019-12-18 22:33:53,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:53,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:53,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321425951] [2019-12-18 22:33:53,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:53,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:53,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:53,671 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:33:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:58,098 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:33:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:33:58,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:33:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:58,784 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:33:58,785 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:33:58,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:34:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:34:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:34:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:34:05,705 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:34:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:05,706 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:34:05,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:34:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:34:05,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:05,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:05,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-18 22:34:05,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:05,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227031984] [2019-12-18 22:34:05,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:05,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227031984] [2019-12-18 22:34:05,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:05,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:05,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243634993] [2019-12-18 22:34:05,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:05,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:05,802 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:34:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:05,972 INFO L93 Difference]: Finished difference Result 37434 states and 130812 transitions. [2019-12-18 22:34:05,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:34:05,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:09,917 INFO L225 Difference]: With dead ends: 37434 [2019-12-18 22:34:09,917 INFO L226 Difference]: Without dead ends: 29372 [2019-12-18 22:34:09,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-12-18 22:34:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 29300. [2019-12-18 22:34:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-18 22:34:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 98618 transitions. [2019-12-18 22:34:10,540 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 98618 transitions. Word has length 13 [2019-12-18 22:34:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:10,540 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 98618 transitions. [2019-12-18 22:34:10,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 98618 transitions. [2019-12-18 22:34:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:10,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:10,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:10,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-18 22:34:10,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:10,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671624286] [2019-12-18 22:34:10,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:10,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671624286] [2019-12-18 22:34:10,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:10,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:10,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432608424] [2019-12-18 22:34:10,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:10,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:10,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:10,601 INFO L87 Difference]: Start difference. First operand 29300 states and 98618 transitions. Second operand 3 states. [2019-12-18 22:34:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:10,775 INFO L93 Difference]: Finished difference Result 43227 states and 144586 transitions. [2019-12-18 22:34:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:10,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:34:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:10,847 INFO L225 Difference]: With dead ends: 43227 [2019-12-18 22:34:10,847 INFO L226 Difference]: Without dead ends: 43227 [2019-12-18 22:34:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2019-12-18 22:34:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 32227. [2019-12-18 22:34:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-12-18 22:34:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 107573 transitions. [2019-12-18 22:34:11,871 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 107573 transitions. Word has length 14 [2019-12-18 22:34:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:11,871 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 107573 transitions. [2019-12-18 22:34:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 107573 transitions. [2019-12-18 22:34:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:11,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:11,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:11,875 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-18 22:34:11,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:11,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293134612] [2019-12-18 22:34:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:11,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293134612] [2019-12-18 22:34:11,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:11,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:11,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272525693] [2019-12-18 22:34:11,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:11,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:11,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:11,982 INFO L87 Difference]: Start difference. First operand 32227 states and 107573 transitions. Second operand 4 states. [2019-12-18 22:34:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:12,322 INFO L93 Difference]: Finished difference Result 39628 states and 130327 transitions. [2019-12-18 22:34:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:12,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:34:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:12,392 INFO L225 Difference]: With dead ends: 39628 [2019-12-18 22:34:12,392 INFO L226 Difference]: Without dead ends: 39539 [2019-12-18 22:34:12,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39539 states. [2019-12-18 22:34:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39539 to 34645. [2019-12-18 22:34:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34645 states. [2019-12-18 22:34:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 115289 transitions. [2019-12-18 22:34:13,058 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 115289 transitions. Word has length 14 [2019-12-18 22:34:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:13,058 INFO L462 AbstractCegarLoop]: Abstraction has 34645 states and 115289 transitions. [2019-12-18 22:34:13,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 115289 transitions. [2019-12-18 22:34:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:13,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:13,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:13,060 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-18 22:34:13,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:13,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229237251] [2019-12-18 22:34:13,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:13,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229237251] [2019-12-18 22:34:13,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:13,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:13,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888705715] [2019-12-18 22:34:13,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:13,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:13,126 INFO L87 Difference]: Start difference. First operand 34645 states and 115289 transitions. Second operand 4 states. [2019-12-18 22:34:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:13,453 INFO L93 Difference]: Finished difference Result 41557 states and 136749 transitions. [2019-12-18 22:34:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:13,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:34:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:13,528 INFO L225 Difference]: With dead ends: 41557 [2019-12-18 22:34:13,528 INFO L226 Difference]: Without dead ends: 41459 [2019-12-18 22:34:13,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41459 states. [2019-12-18 22:34:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41459 to 35260. [2019-12-18 22:34:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35260 states. [2019-12-18 22:34:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35260 states to 35260 states and 117020 transitions. [2019-12-18 22:34:14,476 INFO L78 Accepts]: Start accepts. Automaton has 35260 states and 117020 transitions. Word has length 14 [2019-12-18 22:34:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:14,476 INFO L462 AbstractCegarLoop]: Abstraction has 35260 states and 117020 transitions. [2019-12-18 22:34:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 35260 states and 117020 transitions. [2019-12-18 22:34:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:34:14,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:14,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:14,489 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-18 22:34:14,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:14,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131393269] [2019-12-18 22:34:14,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:14,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131393269] [2019-12-18 22:34:14,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:14,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:14,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669044368] [2019-12-18 22:34:14,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:34:14,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:34:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:14,584 INFO L87 Difference]: Start difference. First operand 35260 states and 117020 transitions. Second operand 5 states. [2019-12-18 22:34:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:15,195 INFO L93 Difference]: Finished difference Result 47518 states and 155149 transitions. [2019-12-18 22:34:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:34:15,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:34:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:15,288 INFO L225 Difference]: With dead ends: 47518 [2019-12-18 22:34:15,288 INFO L226 Difference]: Without dead ends: 47342 [2019-12-18 22:34:15,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47342 states. [2019-12-18 22:34:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47342 to 35974. [2019-12-18 22:34:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2019-12-18 22:34:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 119384 transitions. [2019-12-18 22:34:16,053 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 119384 transitions. Word has length 22 [2019-12-18 22:34:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:16,054 INFO L462 AbstractCegarLoop]: Abstraction has 35974 states and 119384 transitions. [2019-12-18 22:34:16,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 119384 transitions. [2019-12-18 22:34:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:34:16,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:16,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:16,065 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-18 22:34:16,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:16,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848551791] [2019-12-18 22:34:16,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:16,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848551791] [2019-12-18 22:34:16,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:16,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:16,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499870201] [2019-12-18 22:34:16,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:34:16,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:34:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:16,157 INFO L87 Difference]: Start difference. First operand 35974 states and 119384 transitions. Second operand 5 states. [2019-12-18 22:34:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:16,989 INFO L93 Difference]: Finished difference Result 47846 states and 156183 transitions. [2019-12-18 22:34:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:34:16,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:34:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:17,066 INFO L225 Difference]: With dead ends: 47846 [2019-12-18 22:34:17,067 INFO L226 Difference]: Without dead ends: 47578 [2019-12-18 22:34:17,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2019-12-18 22:34:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 33984. [2019-12-18 22:34:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-12-18 22:34:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 112757 transitions. [2019-12-18 22:34:17,710 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 112757 transitions. Word has length 22 [2019-12-18 22:34:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:17,710 INFO L462 AbstractCegarLoop]: Abstraction has 33984 states and 112757 transitions. [2019-12-18 22:34:17,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 112757 transitions. [2019-12-18 22:34:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:34:17,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:17,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:17,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-18 22:34:17,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:17,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939039807] [2019-12-18 22:34:17,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:17,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939039807] [2019-12-18 22:34:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:34:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565852489] [2019-12-18 22:34:17,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:34:17,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:34:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:17,805 INFO L87 Difference]: Start difference. First operand 33984 states and 112757 transitions. Second operand 5 states. [2019-12-18 22:34:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:17,893 INFO L93 Difference]: Finished difference Result 15710 states and 48416 transitions. [2019-12-18 22:34:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:17,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 22:34:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:17,912 INFO L225 Difference]: With dead ends: 15710 [2019-12-18 22:34:17,912 INFO L226 Difference]: Without dead ends: 13401 [2019-12-18 22:34:17,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:34:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13401 states. [2019-12-18 22:34:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13401 to 13209. [2019-12-18 22:34:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13209 states. [2019-12-18 22:34:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13209 states to 13209 states and 40432 transitions. [2019-12-18 22:34:18,098 INFO L78 Accepts]: Start accepts. Automaton has 13209 states and 40432 transitions. Word has length 25 [2019-12-18 22:34:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:18,098 INFO L462 AbstractCegarLoop]: Abstraction has 13209 states and 40432 transitions. [2019-12-18 22:34:18,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13209 states and 40432 transitions. [2019-12-18 22:34:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:34:18,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:18,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:18,118 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-18 22:34:18,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:18,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580415004] [2019-12-18 22:34:18,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:18,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580415004] [2019-12-18 22:34:18,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:18,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:18,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545582415] [2019-12-18 22:34:18,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:18,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:18,175 INFO L87 Difference]: Start difference. First operand 13209 states and 40432 transitions. Second operand 3 states. [2019-12-18 22:34:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:18,262 INFO L93 Difference]: Finished difference Result 24182 states and 73934 transitions. [2019-12-18 22:34:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:18,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:34:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:18,280 INFO L225 Difference]: With dead ends: 24182 [2019-12-18 22:34:18,281 INFO L226 Difference]: Without dead ends: 13560 [2019-12-18 22:34:18,281 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-18 22:34:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-12-18 22:34:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 13402. [2019-12-18 22:34:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2019-12-18 22:34:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 40153 transitions. [2019-12-18 22:34:18,478 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 40153 transitions. Word has length 39 [2019-12-18 22:34:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:18,478 INFO L462 AbstractCegarLoop]: Abstraction has 13402 states and 40153 transitions. [2019-12-18 22:34:18,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 40153 transitions. [2019-12-18 22:34:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:34:18,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:18,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:18,499 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-18 22:34:18,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:18,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317227066] [2019-12-18 22:34:18,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:18,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317227066] [2019-12-18 22:34:18,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:18,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:34:18,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768216174] [2019-12-18 22:34:18,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:34:18,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:34:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:34:18,646 INFO L87 Difference]: Start difference. First operand 13402 states and 40153 transitions. Second operand 6 states. [2019-12-18 22:34:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:19,476 INFO L93 Difference]: Finished difference Result 17114 states and 50062 transitions. [2019-12-18 22:34:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:34:19,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:34:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:19,509 INFO L225 Difference]: With dead ends: 17114 [2019-12-18 22:34:19,509 INFO L226 Difference]: Without dead ends: 16908 [2019-12-18 22:34:19,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:34:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16908 states. [2019-12-18 22:34:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16908 to 14454. [2019-12-18 22:34:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14454 states. [2019-12-18 22:34:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14454 states to 14454 states and 43097 transitions. [2019-12-18 22:34:19,850 INFO L78 Accepts]: Start accepts. Automaton has 14454 states and 43097 transitions. Word has length 40 [2019-12-18 22:34:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:19,850 INFO L462 AbstractCegarLoop]: Abstraction has 14454 states and 43097 transitions. [2019-12-18 22:34:19,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:34:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14454 states and 43097 transitions. [2019-12-18 22:34:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:34:19,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:19,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:19,872 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -261037235, now seen corresponding path program 1 times [2019-12-18 22:34:19,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:19,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786344012] [2019-12-18 22:34:19,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:19,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786344012] [2019-12-18 22:34:19,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:19,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:19,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134476898] [2019-12-18 22:34:19,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:19,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:19,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:19,918 INFO L87 Difference]: Start difference. First operand 14454 states and 43097 transitions. Second operand 3 states. [2019-12-18 22:34:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:20,004 INFO L93 Difference]: Finished difference Result 18080 states and 52635 transitions. [2019-12-18 22:34:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:20,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 22:34:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:20,027 INFO L225 Difference]: With dead ends: 18080 [2019-12-18 22:34:20,027 INFO L226 Difference]: Without dead ends: 18080 [2019-12-18 22:34:20,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18080 states. [2019-12-18 22:34:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18080 to 15080. [2019-12-18 22:34:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2019-12-18 22:34:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 44195 transitions. [2019-12-18 22:34:20,266 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 44195 transitions. Word has length 40 [2019-12-18 22:34:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:20,266 INFO L462 AbstractCegarLoop]: Abstraction has 15080 states and 44195 transitions. [2019-12-18 22:34:20,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 44195 transitions. [2019-12-18 22:34:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:34:20,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:20,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:20,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1603020105, now seen corresponding path program 1 times [2019-12-18 22:34:20,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:20,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618359513] [2019-12-18 22:34:20,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:20,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618359513] [2019-12-18 22:34:20,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:20,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:34:20,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074071403] [2019-12-18 22:34:20,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:34:20,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:34:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:20,368 INFO L87 Difference]: Start difference. First operand 15080 states and 44195 transitions. Second operand 5 states. [2019-12-18 22:34:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:20,893 INFO L93 Difference]: Finished difference Result 22094 states and 64262 transitions. [2019-12-18 22:34:20,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:34:20,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:34:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:20,924 INFO L225 Difference]: With dead ends: 22094 [2019-12-18 22:34:20,924 INFO L226 Difference]: Without dead ends: 22094 [2019-12-18 22:34:20,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:34:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2019-12-18 22:34:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 19658. [2019-12-18 22:34:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19658 states. [2019-12-18 22:34:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19658 states to 19658 states and 57675 transitions. [2019-12-18 22:34:21,211 INFO L78 Accepts]: Start accepts. Automaton has 19658 states and 57675 transitions. Word has length 40 [2019-12-18 22:34:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:21,211 INFO L462 AbstractCegarLoop]: Abstraction has 19658 states and 57675 transitions. [2019-12-18 22:34:21,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:34:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 19658 states and 57675 transitions. [2019-12-18 22:34:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:34:21,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:21,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:21,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1942134771, now seen corresponding path program 2 times [2019-12-18 22:34:21,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:21,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380967811] [2019-12-18 22:34:21,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:21,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380967811] [2019-12-18 22:34:21,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:21,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:34:21,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075576103] [2019-12-18 22:34:21,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:34:21,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:34:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:34:21,316 INFO L87 Difference]: Start difference. First operand 19658 states and 57675 transitions. Second operand 6 states. [2019-12-18 22:34:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:22,082 INFO L93 Difference]: Finished difference Result 34033 states and 100161 transitions. [2019-12-18 22:34:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:34:22,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:34:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:22,129 INFO L225 Difference]: With dead ends: 34033 [2019-12-18 22:34:22,129 INFO L226 Difference]: Without dead ends: 34033 [2019-12-18 22:34:22,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-18 22:34:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 21577. [2019-12-18 22:34:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21577 states. [2019-12-18 22:34:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 63638 transitions. [2019-12-18 22:34:22,508 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 63638 transitions. Word has length 40 [2019-12-18 22:34:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:22,508 INFO L462 AbstractCegarLoop]: Abstraction has 21577 states and 63638 transitions. [2019-12-18 22:34:22,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:34:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 63638 transitions. [2019-12-18 22:34:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:34:22,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:22,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:22,715 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -640785801, now seen corresponding path program 3 times [2019-12-18 22:34:22,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:22,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996186823] [2019-12-18 22:34:22,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:22,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996186823] [2019-12-18 22:34:22,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:22,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:22,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434589516] [2019-12-18 22:34:22,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:22,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:22,798 INFO L87 Difference]: Start difference. First operand 21577 states and 63638 transitions. Second operand 3 states. [2019-12-18 22:34:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:22,867 INFO L93 Difference]: Finished difference Result 18712 states and 54182 transitions. [2019-12-18 22:34:22,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:22,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 22:34:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:22,890 INFO L225 Difference]: With dead ends: 18712 [2019-12-18 22:34:22,890 INFO L226 Difference]: Without dead ends: 18712 [2019-12-18 22:34:22,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18712 states. [2019-12-18 22:34:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18712 to 18416. [2019-12-18 22:34:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18416 states. [2019-12-18 22:34:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18416 states to 18416 states and 53438 transitions. [2019-12-18 22:34:23,132 INFO L78 Accepts]: Start accepts. Automaton has 18416 states and 53438 transitions. Word has length 40 [2019-12-18 22:34:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:23,132 INFO L462 AbstractCegarLoop]: Abstraction has 18416 states and 53438 transitions. [2019-12-18 22:34:23,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 18416 states and 53438 transitions. [2019-12-18 22:34:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:34:23,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:23,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:23,155 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1636648869, now seen corresponding path program 1 times [2019-12-18 22:34:23,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:23,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973716888] [2019-12-18 22:34:23,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:23,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973716888] [2019-12-18 22:34:23,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:23,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:34:23,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043958029] [2019-12-18 22:34:23,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:34:23,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:34:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:34:23,234 INFO L87 Difference]: Start difference. First operand 18416 states and 53438 transitions. Second operand 6 states. [2019-12-18 22:34:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:23,367 INFO L93 Difference]: Finished difference Result 17000 states and 49937 transitions. [2019-12-18 22:34:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:34:23,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:34:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:23,390 INFO L225 Difference]: With dead ends: 17000 [2019-12-18 22:34:23,391 INFO L226 Difference]: Without dead ends: 14150 [2019-12-18 22:34:23,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2019-12-18 22:34:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 12204. [2019-12-18 22:34:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12204 states. [2019-12-18 22:34:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 36721 transitions. [2019-12-18 22:34:23,579 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 36721 transitions. Word has length 41 [2019-12-18 22:34:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:23,579 INFO L462 AbstractCegarLoop]: Abstraction has 12204 states and 36721 transitions. [2019-12-18 22:34:23,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:34:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 36721 transitions. [2019-12-18 22:34:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:34:23,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:23,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:23,592 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1496178910, now seen corresponding path program 1 times [2019-12-18 22:34:23,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:23,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794113126] [2019-12-18 22:34:23,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:23,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794113126] [2019-12-18 22:34:23,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:23,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:23,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377489110] [2019-12-18 22:34:23,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:23,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:23,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:23,650 INFO L87 Difference]: Start difference. First operand 12204 states and 36721 transitions. Second operand 3 states. [2019-12-18 22:34:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:23,701 INFO L93 Difference]: Finished difference Result 12202 states and 36716 transitions. [2019-12-18 22:34:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:23,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:34:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:23,723 INFO L225 Difference]: With dead ends: 12202 [2019-12-18 22:34:23,724 INFO L226 Difference]: Without dead ends: 12202 [2019-12-18 22:34:23,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2019-12-18 22:34:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 10198. [2019-12-18 22:34:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-18 22:34:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 31023 transitions. [2019-12-18 22:34:23,986 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 31023 transitions. Word has length 55 [2019-12-18 22:34:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:23,986 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 31023 transitions. [2019-12-18 22:34:23,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 31023 transitions. [2019-12-18 22:34:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:34:24,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:24,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:24,004 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-18 22:34:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:24,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415590341] [2019-12-18 22:34:24,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:24,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415590341] [2019-12-18 22:34:24,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:24,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:34:24,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9564969] [2019-12-18 22:34:24,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:34:24,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:24,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:34:24,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:34:24,268 INFO L87 Difference]: Start difference. First operand 10198 states and 31023 transitions. Second operand 11 states. [2019-12-18 22:34:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:25,503 INFO L93 Difference]: Finished difference Result 28325 states and 85857 transitions. [2019-12-18 22:34:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 22:34:25,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:34:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:25,540 INFO L225 Difference]: With dead ends: 28325 [2019-12-18 22:34:25,540 INFO L226 Difference]: Without dead ends: 19128 [2019-12-18 22:34:25,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 22:34:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19128 states. [2019-12-18 22:34:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19128 to 12349. [2019-12-18 22:34:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2019-12-18 22:34:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 37034 transitions. [2019-12-18 22:34:25,806 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 37034 transitions. Word has length 56 [2019-12-18 22:34:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:25,806 INFO L462 AbstractCegarLoop]: Abstraction has 12349 states and 37034 transitions. [2019-12-18 22:34:25,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:34:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 37034 transitions. [2019-12-18 22:34:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:34:25,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:25,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:25,819 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 2 times [2019-12-18 22:34:25,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:25,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420572519] [2019-12-18 22:34:25,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420572519] [2019-12-18 22:34:26,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:34:26,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399080954] [2019-12-18 22:34:26,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:34:26,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:34:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:34:26,177 INFO L87 Difference]: Start difference. First operand 12349 states and 37034 transitions. Second operand 15 states. [2019-12-18 22:34:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:30,133 INFO L93 Difference]: Finished difference Result 21756 states and 63815 transitions. [2019-12-18 22:34:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 22:34:30,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 22:34:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:30,164 INFO L225 Difference]: With dead ends: 21756 [2019-12-18 22:34:30,164 INFO L226 Difference]: Without dead ends: 20618 [2019-12-18 22:34:30,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2955, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 22:34:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20618 states. [2019-12-18 22:34:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20618 to 12371. [2019-12-18 22:34:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-18 22:34:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 37072 transitions. [2019-12-18 22:34:30,437 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 37072 transitions. Word has length 56 [2019-12-18 22:34:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:30,437 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 37072 transitions. [2019-12-18 22:34:30,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:34:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 37072 transitions. [2019-12-18 22:34:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:34:30,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:30,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:30,453 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2127044956, now seen corresponding path program 3 times [2019-12-18 22:34:30,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:30,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248142200] [2019-12-18 22:34:30,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:34:30,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248142200] [2019-12-18 22:34:30,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:30,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:34:30,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440530951] [2019-12-18 22:34:30,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:34:30,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:30,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:34:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:34:30,589 INFO L87 Difference]: Start difference. First operand 12371 states and 37072 transitions. Second operand 9 states. [2019-12-18 22:34:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:31,688 INFO L93 Difference]: Finished difference Result 19426 states and 57572 transitions. [2019-12-18 22:34:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:34:31,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 22:34:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:31,714 INFO L225 Difference]: With dead ends: 19426 [2019-12-18 22:34:31,714 INFO L226 Difference]: Without dead ends: 17699 [2019-12-18 22:34:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:34:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17699 states. [2019-12-18 22:34:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17699 to 12747. [2019-12-18 22:34:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12747 states. [2019-12-18 22:34:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12747 states to 12747 states and 38317 transitions. [2019-12-18 22:34:31,937 INFO L78 Accepts]: Start accepts. Automaton has 12747 states and 38317 transitions. Word has length 56 [2019-12-18 22:34:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:31,937 INFO L462 AbstractCegarLoop]: Abstraction has 12747 states and 38317 transitions. [2019-12-18 22:34:31,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:34:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12747 states and 38317 transitions. [2019-12-18 22:34:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:34:31,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:31,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:31,951 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 4 times [2019-12-18 22:34:31,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:31,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95690852] [2019-12-18 22:34:31,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:34:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:34:32,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:34:32,050 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:34:32,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2076~0.base_22| 4)) (= v_~z~0_14 0) (= |v_ULTIMATE.start_main_~#t2076~0.offset_18| 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_22|) |v_ULTIMATE.start_main_~#t2076~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_22|)) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_22| 1)) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2076~0.base_22|) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_14|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t2076~0.base=|v_ULTIMATE.start_main_~#t2076~0.base_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_~#t2076~0.offset=|v_ULTIMATE.start_main_~#t2076~0.offset_18|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2078~0.base, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2078~0.offset, ~y~0, ULTIMATE.start_main_~#t2076~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2077~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2077~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2076~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:34:32,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2077~0.offset_9| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10|) |v_ULTIMATE.start_main_~#t2077~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2077~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2077~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2077~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2077~0.offset] because there is no mapped edge [2019-12-18 22:34:32,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:34:32,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2078~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2078~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2078~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11|) |v_ULTIMATE.start_main_~#t2078~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2078~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2078~0.base] because there is no mapped edge [2019-12-18 22:34:32,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In564955657 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In564955657 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In564955657 |P2Thread1of1ForFork1_#t~ite32_Out564955657|)) (and (= ~x~0_In564955657 |P2Thread1of1ForFork1_#t~ite32_Out564955657|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In564955657, ~x$w_buff1_used~0=~x$w_buff1_used~0_In564955657, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In564955657, ~x~0=~x~0_In564955657} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out564955657|, ~x$w_buff1~0=~x$w_buff1~0_In564955657, ~x$w_buff1_used~0=~x$w_buff1_used~0_In564955657, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In564955657, ~x~0=~x~0_In564955657} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:34:32,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:34:32,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1925009315 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1925009315 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1925009315| 0)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1925009315| ~x$w_buff0_used~0_In-1925009315) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1925009315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1925009315} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1925009315|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1925009315, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1925009315} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:34:32,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1198522599 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1198522599 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1198522599|)) (and (= ~x$w_buff0_used~0_In1198522599 |P1Thread1of1ForFork0_#t~ite28_Out1198522599|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1198522599, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1198522599} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1198522599, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1198522599|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1198522599} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:34:32,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-271643145 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-271643145 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-271643145 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-271643145 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-271643145|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-271643145| ~x$w_buff1_used~0_In-271643145)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-271643145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-271643145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-271643145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-271643145} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-271643145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-271643145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-271643145, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-271643145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-271643145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:34:32,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-731622623 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-731622623 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-731622623) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-731622623 ~x$r_buff0_thd2~0_Out-731622623) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-731622623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-731622623} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-731622623|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-731622623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-731622623} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:34:32,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In263914806 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In263914806 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In263914806 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In263914806 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out263914806| ~x$r_buff1_thd2~0_In263914806) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out263914806| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In263914806, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In263914806, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In263914806, ~x$w_buff0_used~0=~x$w_buff0_used~0_In263914806} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out263914806|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In263914806, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In263914806, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In263914806, ~x$w_buff0_used~0=~x$w_buff0_used~0_In263914806} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:34:32,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:34:32,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-885449975 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-885449975| |P0Thread1of1ForFork2_#t~ite8_Out-885449975|) (= ~x$w_buff0~0_In-885449975 |P0Thread1of1ForFork2_#t~ite9_Out-885449975|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-885449975| |P0Thread1of1ForFork2_#t~ite9_Out-885449975|) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out-885449975| ~x$w_buff0~0_In-885449975) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-885449975 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-885449975 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-885449975 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-885449975 256)))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-885449975, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-885449975, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-885449975|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-885449975, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-885449975, ~weak$$choice2~0=~weak$$choice2~0_In-885449975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885449975} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-885449975, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-885449975, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-885449975|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-885449975, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-885449975|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-885449975, ~weak$$choice2~0=~weak$$choice2~0_In-885449975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-885449975} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:34:32,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In2133099230 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2133099230 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2133099230 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In2133099230 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out2133099230| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out2133099230| ~x$w_buff1_used~0_In2133099230) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2133099230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133099230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133099230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133099230} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2133099230|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133099230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133099230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133099230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133099230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:34:32,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1146660148 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1146660148 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1146660148| ~x$r_buff0_thd3~0_In-1146660148)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1146660148| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146660148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146660148} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1146660148|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146660148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146660148} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:34:32,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In404122446 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In404122446 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In404122446 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In404122446 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out404122446| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In404122446 |P2Thread1of1ForFork1_#t~ite37_Out404122446|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In404122446, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In404122446, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In404122446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404122446} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out404122446|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In404122446, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In404122446, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In404122446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404122446} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:34:32,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:34:32,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In343700991 256)))) (or (and (= ~x$w_buff1_used~0_In343700991 |P0Thread1of1ForFork2_#t~ite17_Out343700991|) (= |P0Thread1of1ForFork2_#t~ite18_Out343700991| |P0Thread1of1ForFork2_#t~ite17_Out343700991|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In343700991 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In343700991 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In343700991 256))) (= (mod ~x$w_buff0_used~0_In343700991 256) 0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite17_In343700991| |P0Thread1of1ForFork2_#t~ite17_Out343700991|) (not .cse1) (= ~x$w_buff1_used~0_In343700991 |P0Thread1of1ForFork2_#t~ite18_Out343700991|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In343700991, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In343700991|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In343700991, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In343700991, ~weak$$choice2~0=~weak$$choice2~0_In343700991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343700991} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In343700991, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out343700991|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out343700991|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In343700991, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In343700991, ~weak$$choice2~0=~weak$$choice2~0_In343700991, ~x$w_buff0_used~0=~x$w_buff0_used~0_In343700991} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:34:32,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:34:32,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-610454571 256))) (.cse4 (= 0 (mod ~x$r_buff1_thd1~0_In-610454571 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-610454571 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In-610454571 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-610454571 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-610454571| |P0Thread1of1ForFork2_#t~ite24_Out-610454571|))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (not .cse3) (or .cse2 (not .cse4)) .cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-610454571| |P0Thread1of1ForFork2_#t~ite22_Out-610454571|) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-610454571|))) (and (= |P0Thread1of1ForFork2_#t~ite22_In-610454571| |P0Thread1of1ForFork2_#t~ite22_Out-610454571|) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-610454571| ~x$r_buff1_thd1~0_In-610454571) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_Out-610454571| |P0Thread1of1ForFork2_#t~ite23_In-610454571|)) (and .cse0 (or (and .cse4 .cse6) (and .cse1 .cse6) .cse3) (= |P0Thread1of1ForFork2_#t~ite23_Out-610454571| ~x$r_buff1_thd1~0_In-610454571) .cse5))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-610454571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-610454571, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-610454571, ~weak$$choice2~0=~weak$$choice2~0_In-610454571, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-610454571|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-610454571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-610454571} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-610454571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-610454571, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-610454571, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-610454571|, ~weak$$choice2~0=~weak$$choice2~0_In-610454571, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-610454571|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-610454571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-610454571} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:34:32,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:34:32,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:34:32,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1711557701 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1711557701 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out1711557701| ~x$w_buff1~0_In1711557701) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1711557701| ~x~0_In1711557701) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1711557701, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1711557701, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1711557701, ~x~0=~x~0_In1711557701} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1711557701|, ~x$w_buff1~0=~x$w_buff1~0_In1711557701, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1711557701, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1711557701, ~x~0=~x~0_In1711557701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:34:32,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:34:32,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1604641450 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1604641450 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1604641450| ~x$w_buff0_used~0_In1604641450) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out1604641450|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1604641450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1604641450} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1604641450, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1604641450|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1604641450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:34:32,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1823847046 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1823847046 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1823847046 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1823847046 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1823847046 |ULTIMATE.start_main_#t~ite44_Out1823847046|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1823847046|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1823847046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823847046, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1823847046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823847046} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1823847046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823847046, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1823847046, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1823847046|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1823847046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:34:32,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1649545362 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1649545362 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1649545362 |ULTIMATE.start_main_#t~ite45_Out-1649545362|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1649545362|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1649545362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649545362} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1649545362, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1649545362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649545362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:34:32,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1258308134 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1258308134 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1258308134 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1258308134 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1258308134| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-1258308134| ~x$r_buff1_thd0~0_In-1258308134) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1258308134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1258308134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1258308134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258308134} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1258308134, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1258308134|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1258308134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1258308134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258308134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:34:32,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:34:32,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:34:32 BasicIcfg [2019-12-18 22:34:32,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:34:32,178 INFO L168 Benchmark]: Toolchain (without parser) took 68655.88 ms. Allocated memory was 141.6 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,178 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 141.6 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:34:32,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.01 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 101.0 MB in the beginning and 157.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.26 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,182 INFO L168 Benchmark]: Boogie Preprocessor took 57.98 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,182 INFO L168 Benchmark]: RCFGBuilder took 821.77 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 105.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,183 INFO L168 Benchmark]: TraceAbstraction took 66882.34 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:34:32,191 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.52 ms. Allocated memory is still 141.6 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.01 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 101.0 MB in the beginning and 157.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.26 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.98 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.77 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 105.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66882.34 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2076, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2077, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2078, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3609 SDtfs, 4743 SDslu, 10095 SDs, 0 SdLazy, 6859 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 26 SyntacticMatches, 16 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 105322 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 102432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...