/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/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:28:13,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:28:13,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:28:13,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:28:13,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:28:13,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:28:13,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:28:13,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:28:13,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:28:13,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:28:13,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:28:13,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:28:13,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:28:13,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:28:13,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:28:13,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:28:13,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:28:13,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:28:13,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:28:13,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:28:13,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:28:13,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:28:13,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:28:13,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:28:13,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:28:13,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:28:13,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:28:13,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:28:13,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:28:13,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:28:13,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:28:13,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:28:13,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:28:13,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:28:13,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:28:13,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:28:13,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:28:13,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:28:13,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:28:13,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:28:13,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:28:13,284 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:28:13,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:28:13,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:28:13,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:28:13,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:28:13,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:28:13,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:28:13,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:28:13,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:28:13,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:28:13,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:28:13,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:28:13,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:28:13,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:28:13,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:28:13,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:28:13,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:28:13,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:28:13,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:28:13,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:28:13,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:28:13,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:28:13,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:28:13,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:28:13,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:28:13,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:28:13,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:28:13,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:28:13,308 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:28:13,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:28:13,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:28:13,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:28:13,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:28:13,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:28:13,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:28:13,581 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:28:13,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-18 22:28:13,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddee60ecd/ff6f9e48410746c991e9f783c366e5a1/FLAGd71436027 [2019-12-18 22:28:14,230 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:28:14,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-18 22:28:14,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddee60ecd/ff6f9e48410746c991e9f783c366e5a1/FLAGd71436027 [2019-12-18 22:28:14,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddee60ecd/ff6f9e48410746c991e9f783c366e5a1 [2019-12-18 22:28:14,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:28:14,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:28:14,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:14,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:28:14,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:28:14,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:14" (1/1) ... [2019-12-18 22:28:14,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7a2df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:14, skipping insertion in model container [2019-12-18 22:28:14,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:14" (1/1) ... [2019-12-18 22:28:14,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:28:14,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:28:15,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:15,183 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:28:15,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:15,352 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:28:15,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15 WrapperNode [2019-12-18 22:28:15,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:15,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:15,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:28:15,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:28:15,363 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:28:15" (1/1) ... [2019-12-18 22:28:15,393 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:28:15" (1/1) ... [2019-12-18 22:28:15,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:15,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:28:15,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:28:15,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:28:15,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:28:15,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:28:15,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:28:15,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:28:15,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (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:28:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:28:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:28:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:28:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:28:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:28:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:28:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:28:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:28:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:28:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:28:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:28:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:28:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:28:15,546 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:28:16,310 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:28:16,310 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:28:16,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:16 BoogieIcfgContainer [2019-12-18 22:28:16,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:28:16,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:28:16,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:28:16,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:28:16,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:28:14" (1/3) ... [2019-12-18 22:28:16,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfdb699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:16, skipping insertion in model container [2019-12-18 22:28:16,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15" (2/3) ... [2019-12-18 22:28:16,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfdb699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:16, skipping insertion in model container [2019-12-18 22:28:16,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:16" (3/3) ... [2019-12-18 22:28:16,321 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2019-12-18 22:28:16,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:28:16,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:28:16,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:28:16,340 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:28:16,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,414 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,414 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,425 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,425 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,426 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,433 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,434 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:16,450 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:28:16,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:28:16,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:28:16,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:28:16,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:28:16,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:28:16,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:28:16,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:28:16,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:28:16,485 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:28:16,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:16,581 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:16,581 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:16,603 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:16,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:16,693 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:16,694 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:16,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:16,732 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:28:16,734 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:28:19,979 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:28:20,096 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:28:20,130 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-18 22:28:20,130 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:28:20,134 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-18 22:28:42,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-18 22:28:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-18 22:28:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:28:42,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:28:42,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:28:42,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:28:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:28:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-18 22:28:42,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:28:42,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507085179] [2019-12-18 22:28:42,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:28:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:28:42,708 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:28:42,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507085179] [2019-12-18 22:28:42,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:28:42,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:28:42,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161333919] [2019-12-18 22:28:42,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:28:42,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:28:42,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:28:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:28:42,728 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-18 22:28:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:28:45,689 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-18 22:28:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:28:45,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:28:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:28:46,466 INFO L225 Difference]: With dead ends: 129324 [2019-12-18 22:28:46,466 INFO L226 Difference]: Without dead ends: 126776 [2019-12-18 22:28:46,468 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:28:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-18 22:28:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-18 22:28:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-18 22:28:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-18 22:28:57,053 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-18 22:28:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:28:57,053 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-18 22:28:57,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:28:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-18 22:28:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:28:57,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:28:57,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:28:57,059 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:28:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:28:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-18 22:28:57,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:28:57,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426285285] [2019-12-18 22:28:57,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:28:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:28:57,192 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:28:57,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426285285] [2019-12-18 22:28:57,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:28:57,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:28:57,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151885008] [2019-12-18 22:28:57,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:28:57,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:28:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:28:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:28:57,195 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-18 22:29:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:02,837 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-18 22:29:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:02,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:29:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:04,055 INFO L225 Difference]: With dead ends: 198216 [2019-12-18 22:29:04,055 INFO L226 Difference]: Without dead ends: 198167 [2019-12-18 22:29:04,056 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:29:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-18 22:29:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-18 22:29:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-18 22:29:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-18 22:29:19,329 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-18 22:29:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:19,330 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-18 22:29:19,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-18 22:29:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:19,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:19,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:19,340 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-18 22:29:19,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:19,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5033510] [2019-12-18 22:29:19,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:19,465 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:29:19,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5033510] [2019-12-18 22:29:19,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:19,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:19,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962671762] [2019-12-18 22:29:19,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:19,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:19,467 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-18 22:29:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:27,287 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-18 22:29:27,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:27,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:29:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:28,188 INFO L225 Difference]: With dead ends: 260296 [2019-12-18 22:29:28,188 INFO L226 Difference]: Without dead ends: 260233 [2019-12-18 22:29:28,189 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:29:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-18 22:29:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-18 22:29:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-18 22:29:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-18 22:29:47,537 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-18 22:29:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:47,538 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-18 22:29:47,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-18 22:29:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:47,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:47,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:47,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-18 22:29:47,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:47,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046602692] [2019-12-18 22:29:47,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:47,614 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:29:47,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046602692] [2019-12-18 22:29:47,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:47,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:47,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967632153] [2019-12-18 22:29:47,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:47,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:47,616 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-18 22:29:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:47,806 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-18 22:29:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:47,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:29:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:47,872 INFO L225 Difference]: With dead ends: 42754 [2019-12-18 22:29:47,872 INFO L226 Difference]: Without dead ends: 42754 [2019-12-18 22:29:47,872 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:29:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-18 22:29:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-18 22:29:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-18 22:29:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-18 22:29:48,585 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-18 22:29:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:48,585 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-18 22:29:48,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-18 22:29:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:29:48,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:48,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:48,590 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-18 22:29:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:48,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099644100] [2019-12-18 22:29:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:48,703 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:29:48,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099644100] [2019-12-18 22:29:48,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:48,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:48,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358695663] [2019-12-18 22:29:48,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:48,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:48,705 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-18 22:29:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:49,630 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-18 22:29:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:29:49,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:29:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:49,719 INFO L225 Difference]: With dead ends: 57358 [2019-12-18 22:29:49,719 INFO L226 Difference]: Without dead ends: 57345 [2019-12-18 22:29:49,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 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:29:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-18 22:29:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-18 22:29:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-18 22:29:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-18 22:29:51,624 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-18 22:29:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:51,624 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-18 22:29:51,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-18 22:29:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:29:51,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:51,636 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:29:51,636 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-18 22:29:51,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:51,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006494344] [2019-12-18 22:29:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:51,704 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:29:51,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006494344] [2019-12-18 22:29:51,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:51,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:51,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876823282] [2019-12-18 22:29:51,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:51,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:51,706 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-18 22:29:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:51,749 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-18 22:29:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:29:51,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:29:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:51,763 INFO L225 Difference]: With dead ends: 8037 [2019-12-18 22:29:51,764 INFO L226 Difference]: Without dead ends: 8037 [2019-12-18 22:29:51,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-18 22:29:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-18 22:29:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-18 22:29:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-18 22:29:51,869 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-18 22:29:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:51,869 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-18 22:29:51,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-18 22:29:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:29:51,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:51,881 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] [2019-12-18 22:29:51,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:51,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:51,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-18 22:29:51,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:51,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108934347] [2019-12-18 22:29:51,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:51,961 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:29:51,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108934347] [2019-12-18 22:29:51,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:51,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:29:51,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383037449] [2019-12-18 22:29:51,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:51,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:51,964 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-18 22:29:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:52,006 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-18 22:29:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:52,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:29:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:52,015 INFO L225 Difference]: With dead ends: 5718 [2019-12-18 22:29:52,015 INFO L226 Difference]: Without dead ends: 5314 [2019-12-18 22:29:52,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-18 22:29:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-18 22:29:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 22:29:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-18 22:29:52,089 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-18 22:29:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:52,089 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-18 22:29:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-18 22:29:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:52,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:52,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:52,098 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-18 22:29:52,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:52,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322803569] [2019-12-18 22:29:52,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:52,179 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:29:52,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322803569] [2019-12-18 22:29:52,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:52,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:52,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420401640] [2019-12-18 22:29:52,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:52,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:52,182 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-18 22:29:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:52,241 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-18 22:29:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:52,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:29:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:52,255 INFO L225 Difference]: With dead ends: 4959 [2019-12-18 22:29:52,255 INFO L226 Difference]: Without dead ends: 4959 [2019-12-18 22:29:52,257 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:29:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-18 22:29:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-18 22:29:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-18 22:29:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-18 22:29:52,366 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-18 22:29:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:52,366 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-18 22:29:52,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-18 22:29:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:52,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:52,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:52,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-18 22:29:52,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:52,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085223508] [2019-12-18 22:29:52,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:52,562 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:29:52,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085223508] [2019-12-18 22:29:52,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:52,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:29:52,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410491605] [2019-12-18 22:29:52,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:52,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:52,570 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 5 states. [2019-12-18 22:29:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:54,391 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-18 22:29:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:29:54,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:29:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:54,404 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 22:29:54,405 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 22:29:54,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:29:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 22:29:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-18 22:29:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-18 22:29:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-18 22:29:54,561 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-18 22:29:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:54,562 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-18 22:29:54,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-18 22:29:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:54,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:54,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:54,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-18 22:29:54,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:54,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169337261] [2019-12-18 22:29:54,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:54,697 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:29:54,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169337261] [2019-12-18 22:29:54,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:54,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:29:54,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120063609] [2019-12-18 22:29:54,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:54,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:54,701 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-18 22:29:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:55,068 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-18 22:29:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:29:55,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:29:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:55,083 INFO L225 Difference]: With dead ends: 9350 [2019-12-18 22:29:55,083 INFO L226 Difference]: Without dead ends: 9350 [2019-12-18 22:29:55,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:29:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-18 22:29:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-18 22:29:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-18 22:29:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-18 22:29:55,260 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-18 22:29:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:55,260 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-18 22:29:55,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-18 22:29:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:55,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:55,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:55,277 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-18 22:29:55,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:55,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445824166] [2019-12-18 22:29:55,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:55,407 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:29:55,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445824166] [2019-12-18 22:29:55,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:55,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:29:55,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380852312] [2019-12-18 22:29:55,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:29:55,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:29:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:29:55,410 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 6 states. [2019-12-18 22:29:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:55,930 INFO L93 Difference]: Finished difference Result 11291 states and 32444 transitions. [2019-12-18 22:29:55,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:29:55,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:29:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:55,945 INFO L225 Difference]: With dead ends: 11291 [2019-12-18 22:29:55,945 INFO L226 Difference]: Without dead ends: 11291 [2019-12-18 22:29:55,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 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:29:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2019-12-18 22:29:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 7569. [2019-12-18 22:29:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 22:29:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 21975 transitions. [2019-12-18 22:29:56,072 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 21975 transitions. Word has length 65 [2019-12-18 22:29:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:56,072 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 21975 transitions. [2019-12-18 22:29:56,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:29:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 21975 transitions. [2019-12-18 22:29:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:56,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:56,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:56,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-18 22:29:56,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:56,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996944861] [2019-12-18 22:29:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:56,199 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:29:56,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996944861] [2019-12-18 22:29:56,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:56,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:56,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628305192] [2019-12-18 22:29:56,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:56,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:56,202 INFO L87 Difference]: Start difference. First operand 7569 states and 21975 transitions. Second operand 3 states. [2019-12-18 22:29:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:56,268 INFO L93 Difference]: Finished difference Result 7568 states and 21973 transitions. [2019-12-18 22:29:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:56,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:29:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:56,281 INFO L225 Difference]: With dead ends: 7568 [2019-12-18 22:29:56,281 INFO L226 Difference]: Without dead ends: 7568 [2019-12-18 22:29:56,282 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:29:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2019-12-18 22:29:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 4867. [2019-12-18 22:29:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2019-12-18 22:29:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 14413 transitions. [2019-12-18 22:29:56,390 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 14413 transitions. Word has length 65 [2019-12-18 22:29:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:56,391 INFO L462 AbstractCegarLoop]: Abstraction has 4867 states and 14413 transitions. [2019-12-18 22:29:56,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 14413 transitions. [2019-12-18 22:29:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:29:56,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:56,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:56,398 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -337801162, now seen corresponding path program 1 times [2019-12-18 22:29:56,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:56,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489257456] [2019-12-18 22:29:56,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:29:56,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489257456] [2019-12-18 22:29:56,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:56,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:56,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336957594] [2019-12-18 22:29:56,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:56,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:56,473 INFO L87 Difference]: Start difference. First operand 4867 states and 14413 transitions. Second operand 3 states. [2019-12-18 22:29:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:56,497 INFO L93 Difference]: Finished difference Result 4463 states and 12919 transitions. [2019-12-18 22:29:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:56,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:29:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:56,505 INFO L225 Difference]: With dead ends: 4463 [2019-12-18 22:29:56,505 INFO L226 Difference]: Without dead ends: 4463 [2019-12-18 22:29:56,509 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:29:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2019-12-18 22:29:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 3739. [2019-12-18 22:29:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-18 22:29:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-18 22:29:56,588 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 66 [2019-12-18 22:29:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:56,588 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-18 22:29:56,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-18 22:29:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:29:56,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:56,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:56,596 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash -347351168, now seen corresponding path program 1 times [2019-12-18 22:29:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:56,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37984011] [2019-12-18 22:29:56,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:56,704 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:29:56,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37984011] [2019-12-18 22:29:56,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:56,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:29:56,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232208092] [2019-12-18 22:29:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:29:56,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:29:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:29:56,709 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 6 states. [2019-12-18 22:29:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:57,284 INFO L93 Difference]: Finished difference Result 6465 states and 18382 transitions. [2019-12-18 22:29:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:29:57,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:29:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:57,293 INFO L225 Difference]: With dead ends: 6465 [2019-12-18 22:29:57,293 INFO L226 Difference]: Without dead ends: 6465 [2019-12-18 22:29:57,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:29:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2019-12-18 22:29:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 3739. [2019-12-18 22:29:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-18 22:29:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-18 22:29:57,368 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 67 [2019-12-18 22:29:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:57,368 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-18 22:29:57,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:29:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-18 22:29:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:29:57,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:57,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:57,374 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1909324032, now seen corresponding path program 2 times [2019-12-18 22:29:57,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:57,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376287319] [2019-12-18 22:29:57,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:57,532 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:29:57,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376287319] [2019-12-18 22:29:57,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:57,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:29:57,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637872190] [2019-12-18 22:29:57,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:29:57,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:29:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:29:57,534 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 7 states. [2019-12-18 22:29:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:57,656 INFO L93 Difference]: Finished difference Result 6971 states and 20283 transitions. [2019-12-18 22:29:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:29:57,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 22:29:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:57,665 INFO L225 Difference]: With dead ends: 6971 [2019-12-18 22:29:57,665 INFO L226 Difference]: Without dead ends: 3978 [2019-12-18 22:29:57,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:29:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-12-18 22:29:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3405. [2019-12-18 22:29:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2019-12-18 22:29:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 9885 transitions. [2019-12-18 22:29:57,808 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 9885 transitions. Word has length 67 [2019-12-18 22:29:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:57,808 INFO L462 AbstractCegarLoop]: Abstraction has 3405 states and 9885 transitions. [2019-12-18 22:29:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:29:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 9885 transitions. [2019-12-18 22:29:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:29:57,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:57,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:57,816 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1990304176, now seen corresponding path program 3 times [2019-12-18 22:29:57,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:57,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601150003] [2019-12-18 22:29:57,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:29:58,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601150003] [2019-12-18 22:29:58,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:58,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:29:58,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124619053] [2019-12-18 22:29:58,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:29:58,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:29:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:29:58,030 INFO L87 Difference]: Start difference. First operand 3405 states and 9885 transitions. Second operand 13 states. [2019-12-18 22:29:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:58,832 INFO L93 Difference]: Finished difference Result 8006 states and 23135 transitions. [2019-12-18 22:29:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:29:58,833 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 22:29:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:58,845 INFO L225 Difference]: With dead ends: 8006 [2019-12-18 22:29:58,845 INFO L226 Difference]: Without dead ends: 7974 [2019-12-18 22:29:58,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:29:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-18 22:29:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 4606. [2019-12-18 22:29:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-18 22:29:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 13240 transitions. [2019-12-18 22:29:58,930 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 13240 transitions. Word has length 67 [2019-12-18 22:29:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:58,931 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 13240 transitions. [2019-12-18 22:29:58,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:29:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 13240 transitions. [2019-12-18 22:29:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:29:58,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:58,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:58,937 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1039202198, now seen corresponding path program 4 times [2019-12-18 22:29:58,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:58,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147890580] [2019-12-18 22:29:58,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:59,011 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:29:59,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147890580] [2019-12-18 22:29:59,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:59,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:59,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100608833] [2019-12-18 22:29:59,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:59,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:59,014 INFO L87 Difference]: Start difference. First operand 4606 states and 13240 transitions. Second operand 3 states. [2019-12-18 22:29:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:59,039 INFO L93 Difference]: Finished difference Result 4202 states and 11764 transitions. [2019-12-18 22:29:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:59,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:29:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:59,046 INFO L225 Difference]: With dead ends: 4202 [2019-12-18 22:29:59,046 INFO L226 Difference]: Without dead ends: 4202 [2019-12-18 22:29:59,047 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:29:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-12-18 22:29:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3952. [2019-12-18 22:29:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-12-18 22:29:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 11078 transitions. [2019-12-18 22:29:59,128 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 11078 transitions. Word has length 67 [2019-12-18 22:29:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:59,128 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 11078 transitions. [2019-12-18 22:29:59,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 11078 transitions. [2019-12-18 22:29:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:29:59,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:59,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:59,135 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-18 22:29:59,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:59,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342040892] [2019-12-18 22:29:59,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:59,517 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:29:59,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342040892] [2019-12-18 22:29:59,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:59,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:29:59,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427964931] [2019-12-18 22:29:59,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:29:59,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:29:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:29:59,519 INFO L87 Difference]: Start difference. First operand 3952 states and 11078 transitions. Second operand 13 states. [2019-12-18 22:30:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:00,297 INFO L93 Difference]: Finished difference Result 5865 states and 16345 transitions. [2019-12-18 22:30:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:30:00,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 22:30:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:00,307 INFO L225 Difference]: With dead ends: 5865 [2019-12-18 22:30:00,308 INFO L226 Difference]: Without dead ends: 5833 [2019-12-18 22:30:00,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:30:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-12-18 22:30:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 3948. [2019-12-18 22:30:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 22:30:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-18 22:30:00,388 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-18 22:30:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:00,388 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-18 22:30:00,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-18 22:30:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:00,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:00,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:00,393 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 2 times [2019-12-18 22:30:00,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:00,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409942059] [2019-12-18 22:30:00,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:00,644 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:30:00,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409942059] [2019-12-18 22:30:00,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:00,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:30:00,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568304026] [2019-12-18 22:30:00,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:30:00,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:30:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:30:00,647 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 14 states. [2019-12-18 22:30:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:01,429 INFO L93 Difference]: Finished difference Result 7046 states and 19795 transitions. [2019-12-18 22:30:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:30:01,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 22:30:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:01,441 INFO L225 Difference]: With dead ends: 7046 [2019-12-18 22:30:01,441 INFO L226 Difference]: Without dead ends: 7014 [2019-12-18 22:30:01,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:30:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-18 22:30:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4160. [2019-12-18 22:30:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-18 22:30:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-18 22:30:01,549 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-18 22:30:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:01,549 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-18 22:30:01,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:30:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-18 22:30:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:01,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:01,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:01,555 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 3 times [2019-12-18 22:30:01,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:01,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632212590] [2019-12-18 22:30:01,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:01,935 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:30:01,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632212590] [2019-12-18 22:30:01,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:01,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:30:01,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516074088] [2019-12-18 22:30:01,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:30:01,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:01,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:30:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:30:01,938 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 15 states. [2019-12-18 22:30:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:03,264 INFO L93 Difference]: Finished difference Result 8354 states and 23446 transitions. [2019-12-18 22:30:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:30:03,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 22:30:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:03,276 INFO L225 Difference]: With dead ends: 8354 [2019-12-18 22:30:03,276 INFO L226 Difference]: Without dead ends: 8322 [2019-12-18 22:30:03,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 22:30:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-18 22:30:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 4752. [2019-12-18 22:30:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4752 states. [2019-12-18 22:30:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 13424 transitions. [2019-12-18 22:30:03,359 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 13424 transitions. Word has length 68 [2019-12-18 22:30:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:03,359 INFO L462 AbstractCegarLoop]: Abstraction has 4752 states and 13424 transitions. [2019-12-18 22:30:03,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:30:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 13424 transitions. [2019-12-18 22:30:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:03,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:03,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:03,364 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash 380679096, now seen corresponding path program 4 times [2019-12-18 22:30:03,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:03,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104857713] [2019-12-18 22:30:03,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:03,697 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:30:03,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104857713] [2019-12-18 22:30:03,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:03,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:30:03,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695372621] [2019-12-18 22:30:03,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:30:03,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:30:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:30:03,699 INFO L87 Difference]: Start difference. First operand 4752 states and 13424 transitions. Second operand 16 states. [2019-12-18 22:30:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:04,946 INFO L93 Difference]: Finished difference Result 7809 states and 21914 transitions. [2019-12-18 22:30:04,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 22:30:04,947 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 22:30:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:04,963 INFO L225 Difference]: With dead ends: 7809 [2019-12-18 22:30:04,963 INFO L226 Difference]: Without dead ends: 7777 [2019-12-18 22:30:04,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 22:30:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2019-12-18 22:30:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 4681. [2019-12-18 22:30:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2019-12-18 22:30:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 13186 transitions. [2019-12-18 22:30:05,130 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 13186 transitions. Word has length 68 [2019-12-18 22:30:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 4681 states and 13186 transitions. [2019-12-18 22:30:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:30:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 13186 transitions. [2019-12-18 22:30:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:05,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:05,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:05,140 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 768786536, now seen corresponding path program 5 times [2019-12-18 22:30:05,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:05,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486751745] [2019-12-18 22:30:05,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:05,724 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:30:05,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486751745] [2019-12-18 22:30:05,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:05,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:30:05,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550203848] [2019-12-18 22:30:05,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:30:05,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:05,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:30:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:30:05,726 INFO L87 Difference]: Start difference. First operand 4681 states and 13186 transitions. Second operand 15 states. [2019-12-18 22:30:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,224 INFO L93 Difference]: Finished difference Result 7361 states and 20418 transitions. [2019-12-18 22:30:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:30:07,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 22:30:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,234 INFO L225 Difference]: With dead ends: 7361 [2019-12-18 22:30:07,234 INFO L226 Difference]: Without dead ends: 7329 [2019-12-18 22:30:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 22:30:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-12-18 22:30:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4306. [2019-12-18 22:30:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4306 states. [2019-12-18 22:30:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 12034 transitions. [2019-12-18 22:30:07,336 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 12034 transitions. Word has length 68 [2019-12-18 22:30:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:07,336 INFO L462 AbstractCegarLoop]: Abstraction has 4306 states and 12034 transitions. [2019-12-18 22:30:07,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:30:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 12034 transitions. [2019-12-18 22:30:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:07,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:07,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:07,340 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:07,340 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 6 times [2019-12-18 22:30:07,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:07,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466715951] [2019-12-18 22:30:07,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:07,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:30:07,492 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:30:07,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_22| 1)) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1961~0.base_22|) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1961~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1961~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1961~0.base_22|) |v_ULTIMATE.start_main_~#t1961~0.offset_16| 0)) |v_#memory_int_21|) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_22|)) (= |v_ULTIMATE.start_main_~#t1961~0.offset_16| 0) (= v_~z$r_buff0_thd0~0_77 0) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_~#t1961~0.offset=|v_ULTIMATE.start_main_~#t1961~0.offset_16|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1961~0.base=|v_ULTIMATE.start_main_~#t1961~0.base_22|, ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_15|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1961~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1963~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1962~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1961~0.base, ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:07,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1962~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11|) |v_ULTIMATE.start_main_~#t1962~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1962~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1962~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1962~0.offset_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1962~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:30:07,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:30:07,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1963~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12|) |v_ULTIMATE.start_main_~#t1963~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1963~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1963~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1963~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1963~0.base] because there is no mapped edge [2019-12-18 22:30:07,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1451085969 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1451085969 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1451085969|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1451085969 |P0Thread1of1ForFork0_#t~ite5_Out-1451085969|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451085969, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1451085969} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1451085969|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1451085969, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1451085969} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:30:07,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1315507453 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1315507453 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1315507453 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1315507453 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1315507453| ~z$w_buff1_used~0_In-1315507453) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1315507453| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315507453, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315507453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315507453, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315507453} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1315507453|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315507453, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1315507453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1315507453, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315507453} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:30:07,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1613885459 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1613885459 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1613885459 0)) (and (= ~z$r_buff0_thd1~0_Out1613885459 ~z$r_buff0_thd1~0_In1613885459) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1613885459, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1613885459} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1613885459, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1613885459|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1613885459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:07,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1192273008 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1192273008 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1192273008 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1192273008 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1192273008| ~z$r_buff1_thd1~0_In1192273008) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out1192273008| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1192273008, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1192273008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1192273008, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1192273008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1192273008, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1192273008|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1192273008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1192273008, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1192273008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:30:07,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:30:07,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1348546016 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1348546016 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1348546016 |P1Thread1of1ForFork1_#t~ite9_Out-1348546016|)) (and (not .cse0) (= ~z$w_buff1~0_In-1348546016 |P1Thread1of1ForFork1_#t~ite9_Out-1348546016|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1348546016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348546016, ~z$w_buff1~0=~z$w_buff1~0_In-1348546016, ~z~0=~z~0_In-1348546016} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1348546016|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1348546016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348546016, ~z$w_buff1~0=~z$w_buff1~0_In-1348546016, ~z~0=~z~0_In-1348546016} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:30:07,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 22:30:07,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1545635597 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1545635597 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1545635597| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1545635597| ~z$w_buff0_used~0_In1545635597)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1545635597, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1545635597} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1545635597, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1545635597|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1545635597} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:30:07,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-653667109 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-653667109 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-653667109| ~z$w_buff1~0_In-653667109) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-653667109| ~z~0_In-653667109) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-653667109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-653667109, ~z$w_buff1~0=~z$w_buff1~0_In-653667109, ~z~0=~z~0_In-653667109} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-653667109|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-653667109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-653667109, ~z$w_buff1~0=~z$w_buff1~0_In-653667109, ~z~0=~z~0_In-653667109} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:30:07,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1113038889 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1113038889 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1113038889 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1113038889 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1113038889 |P1Thread1of1ForFork1_#t~ite12_Out-1113038889|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1113038889| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113038889, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1113038889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113038889, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113038889} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113038889, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1113038889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113038889, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1113038889|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113038889} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:30:07,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-3372272 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-3372272 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-3372272| ~z$r_buff0_thd2~0_In-3372272)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-3372272| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-3372272, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-3372272} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-3372272, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-3372272|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-3372272} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:30:07,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:30:07,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-782923638 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-782923638 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-782923638| ~z$w_buff0_used~0_In-782923638)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-782923638|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-782923638, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782923638} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-782923638, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-782923638, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-782923638|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:30:07,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1751553 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1751553 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1751553 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1751553 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1751553 |P2Thread1of1ForFork2_#t~ite18_Out-1751553|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1751553| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751553, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1751553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751553, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1751553} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751553, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1751553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751553, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1751553, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1751553|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:30:07,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In911011000 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In911011000 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out911011000| ~z$r_buff0_thd3~0_In911011000) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out911011000| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In911011000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In911011000} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In911011000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In911011000, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out911011000|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:30:07,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-160592729 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-160592729 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-160592729 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-160592729 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-160592729| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-160592729 |P2Thread1of1ForFork2_#t~ite20_Out-160592729|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-160592729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-160592729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-160592729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-160592729} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-160592729, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-160592729|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-160592729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-160592729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-160592729} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:30:07,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:30:07,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In456440909 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In456440909 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In456440909 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In456440909 256)))) (or (and (= ~z$r_buff1_thd2~0_In456440909 |P1Thread1of1ForFork1_#t~ite14_Out456440909|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out456440909|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In456440909, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In456440909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In456440909, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In456440909} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In456440909, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In456440909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In456440909, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out456440909|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In456440909} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:30:07,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:30:07,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:30:07,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In759834833 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In759834833 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In759834833 |ULTIMATE.start_main_#t~ite24_Out759834833|)) (and (= ~z~0_In759834833 |ULTIMATE.start_main_#t~ite24_Out759834833|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In759834833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759834833, ~z$w_buff1~0=~z$w_buff1~0_In759834833, ~z~0=~z~0_In759834833} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In759834833, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out759834833|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759834833, ~z$w_buff1~0=~z$w_buff1~0_In759834833, ~z~0=~z~0_In759834833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 22:30:07,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 22:30:07,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In543262921 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In543262921 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out543262921| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out543262921| ~z$w_buff0_used~0_In543262921) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In543262921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In543262921} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In543262921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In543262921, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out543262921|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:30:07,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In228925701 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In228925701 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In228925701 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In228925701 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out228925701|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out228925701| ~z$w_buff1_used~0_In228925701) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In228925701, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228925701, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In228925701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228925701} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In228925701, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228925701, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In228925701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228925701, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out228925701|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:30:07,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1555251507 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1555251507 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1555251507| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1555251507| ~z$r_buff0_thd0~0_In1555251507)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1555251507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555251507} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1555251507, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1555251507|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555251507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:30:07,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In721517460 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In721517460 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In721517460 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In721517460 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out721517460|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In721517460 |ULTIMATE.start_main_#t~ite29_Out721517460|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In721517460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In721517460, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In721517460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In721517460} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In721517460, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out721517460|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In721517460, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In721517460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In721517460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:30:07,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:30:07,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:30:07,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:30:07,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:30:07 BasicIcfg [2019-12-18 22:30:07,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:30:07,663 INFO L168 Benchmark]: Toolchain (without parser) took 113108.46 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 99.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 390.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:07,666 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:30:07,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.36 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 155.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:07,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.53 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:07,668 INFO L168 Benchmark]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 149.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:30:07,668 INFO L168 Benchmark]: RCFGBuilder took 842.49 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:07,672 INFO L168 Benchmark]: TraceAbstraction took 111347.31 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:07,678 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.36 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 155.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.53 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.49 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111347.31 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_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=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3321 SDtfs, 5033 SDslu, 10969 SDs, 0 SdLazy, 5776 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 32 SyntacticMatches, 19 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 101759 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1098 ConstructedInterpolants, 0 QuantifiedInterpolants, 409227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...