/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:10:33,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:10:33,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:10:33,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:10:33,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:10:33,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:10:33,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:10:33,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:10:33,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:10:33,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:10:33,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:10:33,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:10:33,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:10:33,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:10:33,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:10:33,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:10:33,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:10:33,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:10:33,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:10:33,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:10:33,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:10:33,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:10:33,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:10:33,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:10:33,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:10:33,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:10:33,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:10:33,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:10:33,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:10:33,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:10:33,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:10:33,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:10:33,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:10:33,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:10:33,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:10:33,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:10:33,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:10:33,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:10:33,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:10:33,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:10:33,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:10:33,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:10:33,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:10:33,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:10:33,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:10:33,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:10:33,378 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:10:33,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:10:33,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:10:33,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:10:33,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:10:33,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:10:33,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:10:33,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:10:33,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:10:33,382 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:10:33,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:10:33,382 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:10:33,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:10:33,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:10:33,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:10:33,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:10:33,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:10:33,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:10:33,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:10:33,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:10:33,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:10:33,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:10:33,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:10:33,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:10:33,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:10:33,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:10:33,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:10:33,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:10:33,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:10:33,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:10:33,671 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:10:33,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-26 21:10:33,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5443a9f35/3e65788d0f1441fcba6f072700bcc16f/FLAG6f9f298b3 [2019-12-26 21:10:34,253 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:10:34,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-26 21:10:34,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5443a9f35/3e65788d0f1441fcba6f072700bcc16f/FLAG6f9f298b3 [2019-12-26 21:10:34,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5443a9f35/3e65788d0f1441fcba6f072700bcc16f [2019-12-26 21:10:34,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:10:34,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:10:34,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:10:34,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:10:34,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:10:34,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:10:34" (1/1) ... [2019-12-26 21:10:34,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a269e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:34, skipping insertion in model container [2019-12-26 21:10:34,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:10:34" (1/1) ... [2019-12-26 21:10:34,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:10:34,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:10:35,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:10:35,224 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:10:35,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:10:35,375 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:10:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35 WrapperNode [2019-12-26 21:10:35,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:10:35,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:10:35,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:10:35,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:10:35,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:10:35,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:10:35,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:10:35,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:10:35,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (1/1) ... [2019-12-26 21:10:35,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:10:35,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:10:35,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:10:35,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:10:35,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (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-26 21:10:35,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:10:35,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:10:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:10:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:10:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:10:35,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:10:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:10:35,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:10:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:10:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:10:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:10:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:10:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:10:35,583 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:10:36,409 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:10:36,410 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:10:36,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:10:36 BoogieIcfgContainer [2019-12-26 21:10:36,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:10:36,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:10:36,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:10:36,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:10:36,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:10:34" (1/3) ... [2019-12-26 21:10:36,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58289f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:10:36, skipping insertion in model container [2019-12-26 21:10:36,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:35" (2/3) ... [2019-12-26 21:10:36,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58289f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:10:36, skipping insertion in model container [2019-12-26 21:10:36,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:10:36" (3/3) ... [2019-12-26 21:10:36,420 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2019-12-26 21:10:36,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:10:36,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:10:36,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:10:36,437 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:10:36,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,485 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,597 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,597 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:36,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:10:36,642 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:10:36,642 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:10:36,642 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:10:36,642 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:10:36,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:10:36,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:10:36,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:10:36,643 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:10:36,657 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:10:36,658 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:10:36,763 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:10:36,763 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:10:36,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:10:36,804 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:10:36,872 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:10:36,872 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:10:36,885 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:10:36,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:10:36,908 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:10:42,147 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:10:42,291 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:10:42,668 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-26 21:10:42,669 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:10:42,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 21:11:03,681 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:11:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:11:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:11:03,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:03,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:11:03,689 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-26 21:11:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-26 21:11:03,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:03,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14759875] [2019-12-26 21:11:03,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:04,176 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-26 21:11:04,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14759875] [2019-12-26 21:11:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:04,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:11:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597295205] [2019-12-26 21:11:04,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:04,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:04,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:04,199 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:11:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:05,410 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-26 21:11:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:11:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:06,079 INFO L225 Difference]: With dead ends: 119613 [2019-12-26 21:11:06,080 INFO L226 Difference]: Without dead ends: 105755 [2019-12-26 21:11:06,081 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-26 21:11:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-26 21:11:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-26 21:11:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-26 21:11:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-26 21:11:16,717 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-26 21:11:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:16,718 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-26 21:11:16,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-26 21:11:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:11:16,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:16,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:16,722 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-26 21:11:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-26 21:11:16,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:16,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949491040] [2019-12-26 21:11:16,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:16,846 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-26 21:11:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949491040] [2019-12-26 21:11:16,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:16,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:16,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740488311] [2019-12-26 21:11:16,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:16,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:16,849 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-26 21:11:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:22,511 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-26 21:11:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:22,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:11:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:23,153 INFO L225 Difference]: With dead ends: 168845 [2019-12-26 21:11:23,154 INFO L226 Difference]: Without dead ends: 168747 [2019-12-26 21:11:23,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-26 21:11:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-26 21:11:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-26 21:11:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-26 21:11:40,850 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-26 21:11:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-26 21:11:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-26 21:11:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:11:40,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:40,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:40,857 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-26 21:11:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-26 21:11:40,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:40,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151668441] [2019-12-26 21:11:40,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:40,914 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-26 21:11:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151668441] [2019-12-26 21:11:40,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:40,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:40,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957208390] [2019-12-26 21:11:40,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:40,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:40,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:40,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:40,916 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-26 21:11:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:41,095 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-26 21:11:41,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:41,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:11:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:41,172 INFO L225 Difference]: With dead ends: 33476 [2019-12-26 21:11:41,172 INFO L226 Difference]: Without dead ends: 33476 [2019-12-26 21:11:41,173 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-26 21:11:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-26 21:11:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-26 21:11:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-26 21:11:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-26 21:11:41,852 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-26 21:11:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:41,853 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-26 21:11:41,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-26 21:11:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:11:41,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:41,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:41,856 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-26 21:11:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:41,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-26 21:11:41,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:41,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143197248] [2019-12-26 21:11:41,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:41,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143197248] [2019-12-26 21:11:41,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:41,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:41,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109858788] [2019-12-26 21:11:41,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:41,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:41,983 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-26 21:11:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:42,338 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-26 21:11:42,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:42,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:11:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:42,421 INFO L225 Difference]: With dead ends: 41508 [2019-12-26 21:11:42,422 INFO L226 Difference]: Without dead ends: 41508 [2019-12-26 21:11:42,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-26 21:11:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-26 21:11:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-26 21:11:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-26 21:11:44,249 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-26 21:11:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:44,250 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-26 21:11:44,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-26 21:11:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:11:44,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:44,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:44,254 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-26 21:11:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-26 21:11:44,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:44,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039661829] [2019-12-26 21:11:44,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:44,320 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-26 21:11:44,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039661829] [2019-12-26 21:11:44,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:44,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:44,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377522830] [2019-12-26 21:11:44,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:44,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:44,323 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-26 21:11:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:44,549 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-26 21:11:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:44,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:11:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:44,645 INFO L225 Difference]: With dead ends: 54855 [2019-12-26 21:11:44,645 INFO L226 Difference]: Without dead ends: 54855 [2019-12-26 21:11:44,645 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-26 21:11:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-26 21:11:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-26 21:11:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-26 21:11:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-26 21:11:45,437 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-26 21:11:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:45,438 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-26 21:11:45,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-26 21:11:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:11:45,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:45,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:45,441 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-26 21:11:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-26 21:11:45,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:45,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302893152] [2019-12-26 21:11:45,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:45,487 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-26 21:11:45,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302893152] [2019-12-26 21:11:45,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:45,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:45,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463310558] [2019-12-26 21:11:45,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:45,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:45,490 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-26 21:11:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:45,855 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-26 21:11:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:45,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:11:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:45,937 INFO L225 Difference]: With dead ends: 49903 [2019-12-26 21:11:45,937 INFO L226 Difference]: Without dead ends: 49903 [2019-12-26 21:11:45,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-26 21:11:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-26 21:11:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-26 21:11:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-26 21:11:47,093 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-26 21:11:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:47,094 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-26 21:11:47,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-26 21:11:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:11:47,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:47,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:47,103 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-26 21:11:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-26 21:11:47,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:47,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156318636] [2019-12-26 21:11:47,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:47,213 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-26 21:11:47,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156318636] [2019-12-26 21:11:47,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:47,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:47,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772517042] [2019-12-26 21:11:47,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:47,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:47,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:47,215 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-26 21:11:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:47,917 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-26 21:11:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:11:47,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:11:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:48,036 INFO L225 Difference]: With dead ends: 59763 [2019-12-26 21:11:48,036 INFO L226 Difference]: Without dead ends: 59749 [2019-12-26 21:11:48,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-26 21:11:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-26 21:11:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-26 21:11:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-26 21:11:48,953 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-26 21:11:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:48,953 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-26 21:11:48,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-26 21:11:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:11:48,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:48,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:48,962 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-26 21:11:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-26 21:11:48,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:48,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122524610] [2019-12-26 21:11:48,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:49,034 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-26 21:11:49,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122524610] [2019-12-26 21:11:49,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:49,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:49,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961355969] [2019-12-26 21:11:49,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:49,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:49,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:49,036 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-26 21:11:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:49,679 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-26 21:11:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:11:49,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:11:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:50,148 INFO L225 Difference]: With dead ends: 62779 [2019-12-26 21:11:50,148 INFO L226 Difference]: Without dead ends: 62765 [2019-12-26 21:11:50,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-26 21:11:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-26 21:11:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-26 21:11:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-26 21:11:50,922 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-26 21:11:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:50,922 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-26 21:11:50,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-26 21:11:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:11:50,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:50,934 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-26 21:11:50,934 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-26 21:11:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-26 21:11:50,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:50,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86504910] [2019-12-26 21:11:50,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:50,981 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-26 21:11:50,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86504910] [2019-12-26 21:11:50,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:50,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:50,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726289344] [2019-12-26 21:11:50,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:50,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:50,983 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-26 21:11:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:51,074 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-26 21:11:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:11:51,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:11:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:51,099 INFO L225 Difference]: With dead ends: 17503 [2019-12-26 21:11:51,099 INFO L226 Difference]: Without dead ends: 17503 [2019-12-26 21:11:51,100 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-26 21:11:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-26 21:11:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-26 21:11:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:11:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-26 21:11:51,357 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-26 21:11:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:51,358 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-26 21:11:51,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-26 21:11:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:11:51,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:51,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:51,372 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-26 21:11:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-26 21:11:51,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:51,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967431663] [2019-12-26 21:11:51,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:51,410 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-26 21:11:51,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967431663] [2019-12-26 21:11:51,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:51,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:51,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430546473] [2019-12-26 21:11:51,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:51,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:51,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:51,412 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-26 21:11:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:51,532 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-26 21:11:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:51,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:11:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:51,582 INFO L225 Difference]: With dead ends: 22571 [2019-12-26 21:11:51,582 INFO L226 Difference]: Without dead ends: 22571 [2019-12-26 21:11:51,583 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-26 21:11:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-26 21:11:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-26 21:11:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:11:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-26 21:11:52,024 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-26 21:11:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:52,025 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-26 21:11:52,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-26 21:11:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:11:52,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:52,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:52,037 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-26 21:11:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-26 21:11:52,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:52,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320071191] [2019-12-26 21:11:52,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:52,089 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-26 21:11:52,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320071191] [2019-12-26 21:11:52,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:52,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:52,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333112206] [2019-12-26 21:11:52,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:52,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:52,092 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-26 21:11:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:52,426 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-26 21:11:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:11:52,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:11:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:52,456 INFO L225 Difference]: With dead ends: 21146 [2019-12-26 21:11:52,457 INFO L226 Difference]: Without dead ends: 21146 [2019-12-26 21:11:52,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-26 21:11:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-26 21:11:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-26 21:11:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-26 21:11:52,944 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-26 21:11:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:52,945 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-26 21:11:52,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-26 21:11:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:11:52,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:52,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:52,960 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-26 21:11:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-26 21:11:52,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:52,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297466346] [2019-12-26 21:11:52,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:53,066 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-26 21:11:53,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297466346] [2019-12-26 21:11:53,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:53,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:53,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576259704] [2019-12-26 21:11:53,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:53,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:53,071 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-26 21:11:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:53,500 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-26 21:11:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:11:53,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:11:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:53,542 INFO L225 Difference]: With dead ends: 23192 [2019-12-26 21:11:53,542 INFO L226 Difference]: Without dead ends: 23192 [2019-12-26 21:11:53,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-26 21:11:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-26 21:11:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-26 21:11:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-26 21:11:53,863 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-26 21:11:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:53,864 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-26 21:11:53,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-26 21:11:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:11:53,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:53,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:53,884 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-26 21:11:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-26 21:11:53,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:53,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831135424] [2019-12-26 21:11:53,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:53,994 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-26 21:11:53,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831135424] [2019-12-26 21:11:53,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:53,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:53,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070342652] [2019-12-26 21:11:53,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:11:53,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:11:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:11:53,997 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-26 21:11:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:54,740 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-26 21:11:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:54,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 21:11:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:54,776 INFO L225 Difference]: With dead ends: 26785 [2019-12-26 21:11:54,777 INFO L226 Difference]: Without dead ends: 26785 [2019-12-26 21:11:54,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:11:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-26 21:11:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-26 21:11:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-26 21:11:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-26 21:11:55,120 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-26 21:11:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:55,121 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-26 21:11:55,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:11:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-26 21:11:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:11:55,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:55,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:55,142 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-26 21:11:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-26 21:11:55,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:55,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099971221] [2019-12-26 21:11:55,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:55,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099971221] [2019-12-26 21:11:55,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:55,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:55,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066224871] [2019-12-26 21:11:55,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:11:55,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:11:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:11:55,224 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-26 21:11:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:55,963 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-26 21:11:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:55,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 21:11:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:55,999 INFO L225 Difference]: With dead ends: 25915 [2019-12-26 21:11:55,999 INFO L226 Difference]: Without dead ends: 25915 [2019-12-26 21:11:56,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:11:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-26 21:11:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-26 21:11:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-26 21:11:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-26 21:11:56,307 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-26 21:11:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:56,307 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-26 21:11:56,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:11:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-26 21:11:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:11:56,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:56,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:56,325 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-26 21:11:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-26 21:11:56,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:56,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246474538] [2019-12-26 21:11:56,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:56,380 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-26 21:11:56,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246474538] [2019-12-26 21:11:56,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:56,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:11:56,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549570187] [2019-12-26 21:11:56,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:56,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:56,382 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-26 21:11:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:56,447 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-26 21:11:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:56,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:11:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:56,478 INFO L225 Difference]: With dead ends: 17953 [2019-12-26 21:11:56,478 INFO L226 Difference]: Without dead ends: 17953 [2019-12-26 21:11:56,479 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-26 21:11:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-26 21:11:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-26 21:11:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-26 21:11:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-26 21:11:57,015 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-26 21:11:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:57,015 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-26 21:11:57,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-26 21:11:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:11:57,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:57,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:57,032 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-26 21:11:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-26 21:11:57,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:57,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086152313] [2019-12-26 21:11:57,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:57,086 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-26 21:11:57,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086152313] [2019-12-26 21:11:57,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:57,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:57,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526170223] [2019-12-26 21:11:57,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:57,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:57,088 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 5 states. [2019-12-26 21:11:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:57,170 INFO L93 Difference]: Finished difference Result 16745 states and 50707 transitions. [2019-12-26 21:11:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:57,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:11:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:57,200 INFO L225 Difference]: With dead ends: 16745 [2019-12-26 21:11:57,200 INFO L226 Difference]: Without dead ends: 16745 [2019-12-26 21:11:57,200 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-26 21:11:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2019-12-26 21:11:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 16164. [2019-12-26 21:11:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16164 states. [2019-12-26 21:11:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16164 states to 16164 states and 49138 transitions. [2019-12-26 21:11:57,602 INFO L78 Accepts]: Start accepts. Automaton has 16164 states and 49138 transitions. Word has length 40 [2019-12-26 21:11:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:57,602 INFO L462 AbstractCegarLoop]: Abstraction has 16164 states and 49138 transitions. [2019-12-26 21:11:57,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16164 states and 49138 transitions. [2019-12-26 21:11:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:11:57,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:57,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:57,624 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-26 21:11:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash -707354115, now seen corresponding path program 1 times [2019-12-26 21:11:57,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:57,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894964426] [2019-12-26 21:11:57,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:57,726 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-26 21:11:57,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894964426] [2019-12-26 21:11:57,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:57,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:57,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939004115] [2019-12-26 21:11:57,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:57,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:57,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:57,730 INFO L87 Difference]: Start difference. First operand 16164 states and 49138 transitions. Second operand 7 states. [2019-12-26 21:11:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:58,336 INFO L93 Difference]: Finished difference Result 47597 states and 143647 transitions. [2019-12-26 21:11:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:58,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:11:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:58,426 INFO L225 Difference]: With dead ends: 47597 [2019-12-26 21:11:58,426 INFO L226 Difference]: Without dead ends: 36910 [2019-12-26 21:11:58,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:11:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36910 states. [2019-12-26 21:11:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36910 to 19812. [2019-12-26 21:11:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19812 states. [2019-12-26 21:11:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19812 states to 19812 states and 60413 transitions. [2019-12-26 21:11:59,278 INFO L78 Accepts]: Start accepts. Automaton has 19812 states and 60413 transitions. Word has length 64 [2019-12-26 21:11:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:59,278 INFO L462 AbstractCegarLoop]: Abstraction has 19812 states and 60413 transitions. [2019-12-26 21:11:59,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19812 states and 60413 transitions. [2019-12-26 21:11:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:11:59,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:59,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:59,310 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-26 21:11:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -919693373, now seen corresponding path program 2 times [2019-12-26 21:11:59,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20384948] [2019-12-26 21:11:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:59,406 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-26 21:11:59,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20384948] [2019-12-26 21:11:59,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:59,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:59,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908706523] [2019-12-26 21:11:59,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:59,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:59,411 INFO L87 Difference]: Start difference. First operand 19812 states and 60413 transitions. Second operand 7 states. [2019-12-26 21:12:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:00,028 INFO L93 Difference]: Finished difference Result 54647 states and 162905 transitions. [2019-12-26 21:12:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:12:00,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:00,096 INFO L225 Difference]: With dead ends: 54647 [2019-12-26 21:12:00,096 INFO L226 Difference]: Without dead ends: 39740 [2019-12-26 21:12:00,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39740 states. [2019-12-26 21:12:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39740 to 23243. [2019-12-26 21:12:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-26 21:12:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 70535 transitions. [2019-12-26 21:12:00,602 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 70535 transitions. Word has length 64 [2019-12-26 21:12:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:00,603 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 70535 transitions. [2019-12-26 21:12:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 70535 transitions. [2019-12-26 21:12:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:00,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:00,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:00,643 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-26 21:12:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1837972597, now seen corresponding path program 3 times [2019-12-26 21:12:00,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:00,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290556683] [2019-12-26 21:12:00,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:00,739 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-26 21:12:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290556683] [2019-12-26 21:12:00,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:00,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:12:00,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630190002] [2019-12-26 21:12:00,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:00,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:00,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:00,741 INFO L87 Difference]: Start difference. First operand 23243 states and 70535 transitions. Second operand 7 states. [2019-12-26 21:12:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:01,375 INFO L93 Difference]: Finished difference Result 45600 states and 136196 transitions. [2019-12-26 21:12:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:12:01,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:01,433 INFO L225 Difference]: With dead ends: 45600 [2019-12-26 21:12:01,434 INFO L226 Difference]: Without dead ends: 42889 [2019-12-26 21:12:01,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42889 states. [2019-12-26 21:12:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42889 to 23339. [2019-12-26 21:12:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23339 states. [2019-12-26 21:12:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23339 states to 23339 states and 70879 transitions. [2019-12-26 21:12:01,946 INFO L78 Accepts]: Start accepts. Automaton has 23339 states and 70879 transitions. Word has length 64 [2019-12-26 21:12:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:01,946 INFO L462 AbstractCegarLoop]: Abstraction has 23339 states and 70879 transitions. [2019-12-26 21:12:01,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 23339 states and 70879 transitions. [2019-12-26 21:12:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:01,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:01,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:01,979 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-26 21:12:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1711686189, now seen corresponding path program 4 times [2019-12-26 21:12:01,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:01,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217613333] [2019-12-26 21:12:01,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:02,041 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-26 21:12:02,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217613333] [2019-12-26 21:12:02,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:02,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:02,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435784062] [2019-12-26 21:12:02,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:02,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:02,044 INFO L87 Difference]: Start difference. First operand 23339 states and 70879 transitions. Second operand 3 states. [2019-12-26 21:12:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:02,225 INFO L93 Difference]: Finished difference Result 27355 states and 83042 transitions. [2019-12-26 21:12:02,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:02,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:12:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:02,290 INFO L225 Difference]: With dead ends: 27355 [2019-12-26 21:12:02,290 INFO L226 Difference]: Without dead ends: 27355 [2019-12-26 21:12:02,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 21:12:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27355 states. [2019-12-26 21:12:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27355 to 24236. [2019-12-26 21:12:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24236 states. [2019-12-26 21:12:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24236 states to 24236 states and 73842 transitions. [2019-12-26 21:12:02,779 INFO L78 Accepts]: Start accepts. Automaton has 24236 states and 73842 transitions. Word has length 64 [2019-12-26 21:12:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:02,779 INFO L462 AbstractCegarLoop]: Abstraction has 24236 states and 73842 transitions. [2019-12-26 21:12:02,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24236 states and 73842 transitions. [2019-12-26 21:12:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:02,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:02,807 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-26 21:12:02,807 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-26 21:12:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 904135165, now seen corresponding path program 1 times [2019-12-26 21:12:02,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:02,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067200543] [2019-12-26 21:12:02,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:02,887 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-26 21:12:02,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067200543] [2019-12-26 21:12:02,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:02,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:12:02,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196357344] [2019-12-26 21:12:02,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:02,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:02,889 INFO L87 Difference]: Start difference. First operand 24236 states and 73842 transitions. Second operand 7 states. [2019-12-26 21:12:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:03,518 INFO L93 Difference]: Finished difference Result 50352 states and 152486 transitions. [2019-12-26 21:12:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:12:03,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:12:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:03,592 INFO L225 Difference]: With dead ends: 50352 [2019-12-26 21:12:03,593 INFO L226 Difference]: Without dead ends: 47107 [2019-12-26 21:12:03,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47107 states. [2019-12-26 21:12:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47107 to 24368. [2019-12-26 21:12:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24368 states. [2019-12-26 21:12:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24368 states to 24368 states and 74354 transitions. [2019-12-26 21:12:04,135 INFO L78 Accepts]: Start accepts. Automaton has 24368 states and 74354 transitions. Word has length 65 [2019-12-26 21:12:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:04,135 INFO L462 AbstractCegarLoop]: Abstraction has 24368 states and 74354 transitions. [2019-12-26 21:12:04,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 24368 states and 74354 transitions. [2019-12-26 21:12:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:04,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:04,170 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-26 21:12:04,170 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-26 21:12:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1662440961, now seen corresponding path program 2 times [2019-12-26 21:12:04,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:04,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778582734] [2019-12-26 21:12:04,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:04,238 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-26 21:12:04,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778582734] [2019-12-26 21:12:04,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:04,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:04,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197300432] [2019-12-26 21:12:04,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:04,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:04,240 INFO L87 Difference]: Start difference. First operand 24368 states and 74354 transitions. Second operand 4 states. [2019-12-26 21:12:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:04,594 INFO L93 Difference]: Finished difference Result 24095 states and 73373 transitions. [2019-12-26 21:12:04,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:12:04,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 21:12:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:04,625 INFO L225 Difference]: With dead ends: 24095 [2019-12-26 21:12:04,625 INFO L226 Difference]: Without dead ends: 24095 [2019-12-26 21:12:04,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24095 states. [2019-12-26 21:12:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24095 to 23198. [2019-12-26 21:12:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23198 states. [2019-12-26 21:12:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23198 states to 23198 states and 70410 transitions. [2019-12-26 21:12:04,963 INFO L78 Accepts]: Start accepts. Automaton has 23198 states and 70410 transitions. Word has length 65 [2019-12-26 21:12:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:04,963 INFO L462 AbstractCegarLoop]: Abstraction has 23198 states and 70410 transitions. [2019-12-26 21:12:04,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 23198 states and 70410 transitions. [2019-12-26 21:12:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:04,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:04,985 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-26 21:12:04,986 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-26 21:12:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 651721355, now seen corresponding path program 1 times [2019-12-26 21:12:04,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:04,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418217302] [2019-12-26 21:12:04,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:05,171 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-26 21:12:05,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418217302] [2019-12-26 21:12:05,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:05,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:12:05,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57729824] [2019-12-26 21:12:05,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:05,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:05,174 INFO L87 Difference]: Start difference. First operand 23198 states and 70410 transitions. Second operand 11 states. [2019-12-26 21:12:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:07,923 INFO L93 Difference]: Finished difference Result 47904 states and 143126 transitions. [2019-12-26 21:12:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 21:12:07,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 21:12:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:07,989 INFO L225 Difference]: With dead ends: 47904 [2019-12-26 21:12:07,989 INFO L226 Difference]: Without dead ends: 47596 [2019-12-26 21:12:07,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 21:12:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47596 states. [2019-12-26 21:12:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47596 to 29540. [2019-12-26 21:12:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29540 states. [2019-12-26 21:12:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29540 states to 29540 states and 88716 transitions. [2019-12-26 21:12:08,592 INFO L78 Accepts]: Start accepts. Automaton has 29540 states and 88716 transitions. Word has length 65 [2019-12-26 21:12:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:08,593 INFO L462 AbstractCegarLoop]: Abstraction has 29540 states and 88716 transitions. [2019-12-26 21:12:08,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29540 states and 88716 transitions. [2019-12-26 21:12:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:08,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:08,626 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-26 21:12:08,626 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash -362903197, now seen corresponding path program 2 times [2019-12-26 21:12:08,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:08,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346237027] [2019-12-26 21:12:08,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:08,804 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-26 21:12:08,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346237027] [2019-12-26 21:12:08,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:08,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:12:08,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49758909] [2019-12-26 21:12:08,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:12:08,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:12:08,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:12:08,807 INFO L87 Difference]: Start difference. First operand 29540 states and 88716 transitions. Second operand 9 states. [2019-12-26 21:12:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:10,245 INFO L93 Difference]: Finished difference Result 46342 states and 136851 transitions. [2019-12-26 21:12:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:12:10,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:12:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:10,311 INFO L225 Difference]: With dead ends: 46342 [2019-12-26 21:12:10,311 INFO L226 Difference]: Without dead ends: 46098 [2019-12-26 21:12:10,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:12:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46098 states. [2019-12-26 21:12:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46098 to 35067. [2019-12-26 21:12:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35067 states. [2019-12-26 21:12:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35067 states to 35067 states and 104985 transitions. [2019-12-26 21:12:11,172 INFO L78 Accepts]: Start accepts. Automaton has 35067 states and 104985 transitions. Word has length 65 [2019-12-26 21:12:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:11,173 INFO L462 AbstractCegarLoop]: Abstraction has 35067 states and 104985 transitions. [2019-12-26 21:12:11,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:12:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 35067 states and 104985 transitions. [2019-12-26 21:12:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:11,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:11,209 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-26 21:12:11,209 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1821010667, now seen corresponding path program 3 times [2019-12-26 21:12:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:11,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476594061] [2019-12-26 21:12:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:11,295 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-26 21:12:11,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476594061] [2019-12-26 21:12:11,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:11,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:12:11,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563358612] [2019-12-26 21:12:11,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:11,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:11,297 INFO L87 Difference]: Start difference. First operand 35067 states and 104985 transitions. Second operand 5 states. [2019-12-26 21:12:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:11,874 INFO L93 Difference]: Finished difference Result 41537 states and 123116 transitions. [2019-12-26 21:12:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:12:11,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 21:12:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:11,931 INFO L225 Difference]: With dead ends: 41537 [2019-12-26 21:12:11,932 INFO L226 Difference]: Without dead ends: 41537 [2019-12-26 21:12:11,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:12:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41537 states. [2019-12-26 21:12:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41537 to 35319. [2019-12-26 21:12:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35319 states. [2019-12-26 21:12:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 105666 transitions. [2019-12-26 21:12:12,499 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 105666 transitions. Word has length 65 [2019-12-26 21:12:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:12,499 INFO L462 AbstractCegarLoop]: Abstraction has 35319 states and 105666 transitions. [2019-12-26 21:12:12,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 105666 transitions. [2019-12-26 21:12:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:12,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:12,537 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-26 21:12:12,538 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash 727172643, now seen corresponding path program 4 times [2019-12-26 21:12:12,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:12,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221788303] [2019-12-26 21:12:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:12,595 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-26 21:12:12,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221788303] [2019-12-26 21:12:12,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:12,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:12,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800804299] [2019-12-26 21:12:12,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:12,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:12,598 INFO L87 Difference]: Start difference. First operand 35319 states and 105666 transitions. Second operand 3 states. [2019-12-26 21:12:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:12,775 INFO L93 Difference]: Finished difference Result 35319 states and 105665 transitions. [2019-12-26 21:12:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:12:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:12,868 INFO L225 Difference]: With dead ends: 35319 [2019-12-26 21:12:12,868 INFO L226 Difference]: Without dead ends: 35319 [2019-12-26 21:12:12,868 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-26 21:12:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35319 states. [2019-12-26 21:12:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35319 to 25386. [2019-12-26 21:12:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25386 states. [2019-12-26 21:12:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25386 states to 25386 states and 77825 transitions. [2019-12-26 21:12:13,568 INFO L78 Accepts]: Start accepts. Automaton has 25386 states and 77825 transitions. Word has length 65 [2019-12-26 21:12:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:13,568 INFO L462 AbstractCegarLoop]: Abstraction has 25386 states and 77825 transitions. [2019-12-26 21:12:13,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25386 states and 77825 transitions. [2019-12-26 21:12:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:13,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:13,597 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-26 21:12:13,598 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-26 21:12:13,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:13,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038520050] [2019-12-26 21:12:13,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:13,659 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-26 21:12:13,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038520050] [2019-12-26 21:12:13,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:13,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:13,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563700717] [2019-12-26 21:12:13,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:13,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:13,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:13,661 INFO L87 Difference]: Start difference. First operand 25386 states and 77825 transitions. Second operand 3 states. [2019-12-26 21:12:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:13,736 INFO L93 Difference]: Finished difference Result 20296 states and 61096 transitions. [2019-12-26 21:12:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:13,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:12:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:13,761 INFO L225 Difference]: With dead ends: 20296 [2019-12-26 21:12:13,761 INFO L226 Difference]: Without dead ends: 20296 [2019-12-26 21:12:13,761 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-26 21:12:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20296 states. [2019-12-26 21:12:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20296 to 17822. [2019-12-26 21:12:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17822 states. [2019-12-26 21:12:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17822 states to 17822 states and 53598 transitions. [2019-12-26 21:12:14,230 INFO L78 Accepts]: Start accepts. Automaton has 17822 states and 53598 transitions. Word has length 66 [2019-12-26 21:12:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:14,230 INFO L462 AbstractCegarLoop]: Abstraction has 17822 states and 53598 transitions. [2019-12-26 21:12:14,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17822 states and 53598 transitions. [2019-12-26 21:12:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:14,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:14,248 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-26 21:12:14,249 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-26 21:12:14,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:14,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853814716] [2019-12-26 21:12:14,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:14,442 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-26 21:12:14,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853814716] [2019-12-26 21:12:14,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:14,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:12:14,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584975120] [2019-12-26 21:12:14,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:12:14,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:12:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:12:14,444 INFO L87 Difference]: Start difference. First operand 17822 states and 53598 transitions. Second operand 10 states. [2019-12-26 21:12:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:15,628 INFO L93 Difference]: Finished difference Result 26444 states and 79089 transitions. [2019-12-26 21:12:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:12:15,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:12:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:15,660 INFO L225 Difference]: With dead ends: 26444 [2019-12-26 21:12:15,660 INFO L226 Difference]: Without dead ends: 21962 [2019-12-26 21:12:15,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:12:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21962 states. [2019-12-26 21:12:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21962 to 18252. [2019-12-26 21:12:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18252 states. [2019-12-26 21:12:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18252 states to 18252 states and 54752 transitions. [2019-12-26 21:12:15,955 INFO L78 Accepts]: Start accepts. Automaton has 18252 states and 54752 transitions. Word has length 67 [2019-12-26 21:12:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:15,956 INFO L462 AbstractCegarLoop]: Abstraction has 18252 states and 54752 transitions. [2019-12-26 21:12:15,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:12:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18252 states and 54752 transitions. [2019-12-26 21:12:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:15,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:15,973 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-26 21:12:15,974 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-26 21:12:15,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:15,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313399918] [2019-12-26 21:12:15,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:16,136 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-26 21:12:16,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313399918] [2019-12-26 21:12:16,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:16,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:16,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979176523] [2019-12-26 21:12:16,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:16,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:16,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:16,139 INFO L87 Difference]: Start difference. First operand 18252 states and 54752 transitions. Second operand 11 states. [2019-12-26 21:12:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:17,432 INFO L93 Difference]: Finished difference Result 24716 states and 73512 transitions. [2019-12-26 21:12:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:12:17,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:17,462 INFO L225 Difference]: With dead ends: 24716 [2019-12-26 21:12:17,463 INFO L226 Difference]: Without dead ends: 21548 [2019-12-26 21:12:17,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:12:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21548 states. [2019-12-26 21:12:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21548 to 18142. [2019-12-26 21:12:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18142 states. [2019-12-26 21:12:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18142 states to 18142 states and 54430 transitions. [2019-12-26 21:12:17,753 INFO L78 Accepts]: Start accepts. Automaton has 18142 states and 54430 transitions. Word has length 67 [2019-12-26 21:12:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:17,754 INFO L462 AbstractCegarLoop]: Abstraction has 18142 states and 54430 transitions. [2019-12-26 21:12:17,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18142 states and 54430 transitions. [2019-12-26 21:12:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:17,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:17,770 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-26 21:12:17,770 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-26 21:12:17,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:17,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104686867] [2019-12-26 21:12:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:17,918 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-26 21:12:17,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104686867] [2019-12-26 21:12:17,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:17,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:12:17,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534268111] [2019-12-26 21:12:17,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:12:17,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:12:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:12:17,922 INFO L87 Difference]: Start difference. First operand 18142 states and 54430 transitions. Second operand 10 states. [2019-12-26 21:12:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:19,207 INFO L93 Difference]: Finished difference Result 26783 states and 79350 transitions. [2019-12-26 21:12:19,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:12:19,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:12:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:19,240 INFO L225 Difference]: With dead ends: 26783 [2019-12-26 21:12:19,240 INFO L226 Difference]: Without dead ends: 23216 [2019-12-26 21:12:19,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:12:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-26 21:12:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18588. [2019-12-26 21:12:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18588 states. [2019-12-26 21:12:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18588 states to 18588 states and 55516 transitions. [2019-12-26 21:12:19,539 INFO L78 Accepts]: Start accepts. Automaton has 18588 states and 55516 transitions. Word has length 67 [2019-12-26 21:12:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:19,539 INFO L462 AbstractCegarLoop]: Abstraction has 18588 states and 55516 transitions. [2019-12-26 21:12:19,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:12:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18588 states and 55516 transitions. [2019-12-26 21:12:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:19,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:19,557 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-26 21:12:19,557 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-26 21:12:19,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:19,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244715385] [2019-12-26 21:12:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:19,716 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-26 21:12:19,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244715385] [2019-12-26 21:12:19,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:19,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:19,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026198924] [2019-12-26 21:12:19,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:19,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:19,718 INFO L87 Difference]: Start difference. First operand 18588 states and 55516 transitions. Second operand 11 states. [2019-12-26 21:12:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:21,049 INFO L93 Difference]: Finished difference Result 25727 states and 76124 transitions. [2019-12-26 21:12:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:12:21,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:21,080 INFO L225 Difference]: With dead ends: 25727 [2019-12-26 21:12:21,080 INFO L226 Difference]: Without dead ends: 22791 [2019-12-26 21:12:21,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:12:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22791 states. [2019-12-26 21:12:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22791 to 18248. [2019-12-26 21:12:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2019-12-26 21:12:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 54521 transitions. [2019-12-26 21:12:21,383 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 54521 transitions. Word has length 67 [2019-12-26 21:12:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:21,383 INFO L462 AbstractCegarLoop]: Abstraction has 18248 states and 54521 transitions. [2019-12-26 21:12:21,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 54521 transitions. [2019-12-26 21:12:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:21,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:21,400 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-26 21:12:21,400 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-26 21:12:21,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:21,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367132534] [2019-12-26 21:12:21,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:21,972 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-26 21:12:21,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367132534] [2019-12-26 21:12:21,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:21,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:12:21,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547549861] [2019-12-26 21:12:21,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 21:12:21,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 21:12:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:12:21,974 INFO L87 Difference]: Start difference. First operand 18248 states and 54521 transitions. Second operand 17 states. [2019-12-26 21:12:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:26,570 INFO L93 Difference]: Finished difference Result 26132 states and 77339 transitions. [2019-12-26 21:12:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 21:12:26,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-26 21:12:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:26,613 INFO L225 Difference]: With dead ends: 26132 [2019-12-26 21:12:26,613 INFO L226 Difference]: Without dead ends: 23751 [2019-12-26 21:12:26,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 21:12:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23751 states. [2019-12-26 21:12:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23751 to 18709. [2019-12-26 21:12:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18709 states. [2019-12-26 21:12:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18709 states to 18709 states and 55659 transitions. [2019-12-26 21:12:26,923 INFO L78 Accepts]: Start accepts. Automaton has 18709 states and 55659 transitions. Word has length 67 [2019-12-26 21:12:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:26,923 INFO L462 AbstractCegarLoop]: Abstraction has 18709 states and 55659 transitions. [2019-12-26 21:12:26,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 21:12:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 18709 states and 55659 transitions. [2019-12-26 21:12:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:26,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:26,941 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-26 21:12:26,941 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1241758622, now seen corresponding path program 6 times [2019-12-26 21:12:26,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:26,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511672195] [2019-12-26 21:12:26,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:27,157 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-26 21:12:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511672195] [2019-12-26 21:12:27,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:27,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:27,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625166700] [2019-12-26 21:12:27,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:27,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:27,160 INFO L87 Difference]: Start difference. First operand 18709 states and 55659 transitions. Second operand 11 states. [2019-12-26 21:12:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:28,401 INFO L93 Difference]: Finished difference Result 36719 states and 108753 transitions. [2019-12-26 21:12:28,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:12:28,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:28,448 INFO L225 Difference]: With dead ends: 36719 [2019-12-26 21:12:28,448 INFO L226 Difference]: Without dead ends: 34804 [2019-12-26 21:12:28,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:12:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34804 states. [2019-12-26 21:12:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34804 to 21010. [2019-12-26 21:12:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21010 states. [2019-12-26 21:12:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21010 states to 21010 states and 62363 transitions. [2019-12-26 21:12:29,032 INFO L78 Accepts]: Start accepts. Automaton has 21010 states and 62363 transitions. Word has length 67 [2019-12-26 21:12:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:29,032 INFO L462 AbstractCegarLoop]: Abstraction has 21010 states and 62363 transitions. [2019-12-26 21:12:29,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21010 states and 62363 transitions. [2019-12-26 21:12:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:29,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:29,052 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-26 21:12:29,052 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1213952882, now seen corresponding path program 7 times [2019-12-26 21:12:29,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:29,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589454944] [2019-12-26 21:12:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:29,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-26 21:12:29,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589454944] [2019-12-26 21:12:29,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:29,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:12:29,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599466434] [2019-12-26 21:12:29,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:12:29,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:12:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:12:29,522 INFO L87 Difference]: Start difference. First operand 21010 states and 62363 transitions. Second operand 16 states. [2019-12-26 21:12:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:35,290 INFO L93 Difference]: Finished difference Result 43246 states and 125681 transitions. [2019-12-26 21:12:35,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-26 21:12:35,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 21:12:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:35,341 INFO L225 Difference]: With dead ends: 43246 [2019-12-26 21:12:35,341 INFO L226 Difference]: Without dead ends: 36822 [2019-12-26 21:12:35,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 21:12:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36822 states. [2019-12-26 21:12:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36822 to 19423. [2019-12-26 21:12:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19423 states. [2019-12-26 21:12:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19423 states to 19423 states and 57770 transitions. [2019-12-26 21:12:35,772 INFO L78 Accepts]: Start accepts. Automaton has 19423 states and 57770 transitions. Word has length 67 [2019-12-26 21:12:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:35,772 INFO L462 AbstractCegarLoop]: Abstraction has 19423 states and 57770 transitions. [2019-12-26 21:12:35,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:12:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19423 states and 57770 transitions. [2019-12-26 21:12:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:35,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:35,793 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-26 21:12:35,794 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash 596838662, now seen corresponding path program 8 times [2019-12-26 21:12:35,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:35,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614456811] [2019-12-26 21:12:35,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:36,309 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-26 21:12:36,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614456811] [2019-12-26 21:12:36,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:36,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:12:36,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358571785] [2019-12-26 21:12:36,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 21:12:36,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:36,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 21:12:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:12:36,311 INFO L87 Difference]: Start difference. First operand 19423 states and 57770 transitions. Second operand 17 states. [2019-12-26 21:12:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:38,986 INFO L93 Difference]: Finished difference Result 24600 states and 72755 transitions. [2019-12-26 21:12:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:12:38,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-26 21:12:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:39,018 INFO L225 Difference]: With dead ends: 24600 [2019-12-26 21:12:39,018 INFO L226 Difference]: Without dead ends: 23525 [2019-12-26 21:12:39,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:12:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23525 states. [2019-12-26 21:12:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23525 to 19620. [2019-12-26 21:12:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19620 states. [2019-12-26 21:12:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19620 states to 19620 states and 58276 transitions. [2019-12-26 21:12:39,323 INFO L78 Accepts]: Start accepts. Automaton has 19620 states and 58276 transitions. Word has length 67 [2019-12-26 21:12:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:39,324 INFO L462 AbstractCegarLoop]: Abstraction has 19620 states and 58276 transitions. [2019-12-26 21:12:39,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 21:12:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19620 states and 58276 transitions. [2019-12-26 21:12:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:39,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:39,344 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-26 21:12:39,344 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1285388222, now seen corresponding path program 9 times [2019-12-26 21:12:39,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:39,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555217470] [2019-12-26 21:12:39,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:39,557 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-26 21:12:39,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555217470] [2019-12-26 21:12:39,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:39,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:12:39,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254827518] [2019-12-26 21:12:39,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 21:12:39,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:39,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 21:12:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:12:39,559 INFO L87 Difference]: Start difference. First operand 19620 states and 58276 transitions. Second operand 13 states. [2019-12-26 21:12:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:40,880 INFO L93 Difference]: Finished difference Result 25487 states and 75037 transitions. [2019-12-26 21:12:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:12:40,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-26 21:12:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:40,912 INFO L225 Difference]: With dead ends: 25487 [2019-12-26 21:12:40,912 INFO L226 Difference]: Without dead ends: 24292 [2019-12-26 21:12:40,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:12:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24292 states. [2019-12-26 21:12:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24292 to 19630. [2019-12-26 21:12:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19630 states. [2019-12-26 21:12:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19630 states to 19630 states and 58295 transitions. [2019-12-26 21:12:41,232 INFO L78 Accepts]: Start accepts. Automaton has 19630 states and 58295 transitions. Word has length 67 [2019-12-26 21:12:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:41,233 INFO L462 AbstractCegarLoop]: Abstraction has 19630 states and 58295 transitions. [2019-12-26 21:12:41,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 21:12:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 19630 states and 58295 transitions. [2019-12-26 21:12:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:41,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:41,253 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-26 21:12:41,254 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash -342300858, now seen corresponding path program 10 times [2019-12-26 21:12:41,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:41,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484985414] [2019-12-26 21:12:41,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:41,435 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-26 21:12:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484985414] [2019-12-26 21:12:41,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:41,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792944932] [2019-12-26 21:12:41,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:41,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:41,437 INFO L87 Difference]: Start difference. First operand 19630 states and 58295 transitions. Second operand 11 states. [2019-12-26 21:12:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:42,489 INFO L93 Difference]: Finished difference Result 33182 states and 97812 transitions. [2019-12-26 21:12:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:12:42,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:42,527 INFO L225 Difference]: With dead ends: 33182 [2019-12-26 21:12:42,527 INFO L226 Difference]: Without dead ends: 29404 [2019-12-26 21:12:42,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:12:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2019-12-26 21:12:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 17296. [2019-12-26 21:12:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17296 states. [2019-12-26 21:12:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17296 states to 17296 states and 51604 transitions. [2019-12-26 21:12:42,851 INFO L78 Accepts]: Start accepts. Automaton has 17296 states and 51604 transitions. Word has length 67 [2019-12-26 21:12:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:42,851 INFO L462 AbstractCegarLoop]: Abstraction has 17296 states and 51604 transitions. [2019-12-26 21:12:42,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17296 states and 51604 transitions. [2019-12-26 21:12:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:42,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:42,868 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-26 21:12:42,868 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:42,868 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 11 times [2019-12-26 21:12:42,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:42,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262397118] [2019-12-26 21:12:42,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:43,319 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-26 21:12:43,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262397118] [2019-12-26 21:12:43,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:43,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 21:12:43,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224161388] [2019-12-26 21:12:43,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 21:12:43,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 21:12:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:12:43,321 INFO L87 Difference]: Start difference. First operand 17296 states and 51604 transitions. Second operand 18 states. [2019-12-26 21:12:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:45,478 INFO L93 Difference]: Finished difference Result 19036 states and 55893 transitions. [2019-12-26 21:12:45,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:12:45,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-26 21:12:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:45,503 INFO L225 Difference]: With dead ends: 19036 [2019-12-26 21:12:45,503 INFO L226 Difference]: Without dead ends: 18907 [2019-12-26 21:12:45,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 21:12:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18907 states. [2019-12-26 21:12:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18907 to 17340. [2019-12-26 21:12:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-26 21:12:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51307 transitions. [2019-12-26 21:12:45,752 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51307 transitions. Word has length 67 [2019-12-26 21:12:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:45,752 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51307 transitions. [2019-12-26 21:12:45,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 21:12:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51307 transitions. [2019-12-26 21:12:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:45,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:45,769 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-26 21:12:45,769 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1431062134, now seen corresponding path program 12 times [2019-12-26 21:12:45,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:45,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254369772] [2019-12-26 21:12:45,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:45,908 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-26 21:12:45,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254369772] [2019-12-26 21:12:45,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:45,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:12:45,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38566943] [2019-12-26 21:12:45,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:12:45,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:12:45,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:12:45,910 INFO L87 Difference]: Start difference. First operand 17340 states and 51307 transitions. Second operand 12 states. [2019-12-26 21:12:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:46,842 INFO L93 Difference]: Finished difference Result 29610 states and 87273 transitions. [2019-12-26 21:12:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:12:46,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:12:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:46,881 INFO L225 Difference]: With dead ends: 29610 [2019-12-26 21:12:46,881 INFO L226 Difference]: Without dead ends: 29355 [2019-12-26 21:12:46,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:12:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29355 states. [2019-12-26 21:12:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29355 to 17060. [2019-12-26 21:12:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17060 states. [2019-12-26 21:12:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17060 states to 17060 states and 50618 transitions. [2019-12-26 21:12:47,205 INFO L78 Accepts]: Start accepts. Automaton has 17060 states and 50618 transitions. Word has length 67 [2019-12-26 21:12:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:47,205 INFO L462 AbstractCegarLoop]: Abstraction has 17060 states and 50618 transitions. [2019-12-26 21:12:47,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:12:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 17060 states and 50618 transitions. [2019-12-26 21:12:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:47,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:47,222 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-26 21:12:47,222 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 13 times [2019-12-26 21:12:47,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:47,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889418652] [2019-12-26 21:12:47,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:47,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:12:47,369 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:12:47,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (= 0 v_~x~0_134) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t62~0.base_32|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t62~0.base_32| 4) |v_#length_23|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t62~0.offset_23|) (= v_~z$read_delayed~0_6 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t62~0.base_32|) 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_32|) |v_ULTIMATE.start_main_~#t62~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t62~0.base_32| 1) |v_#valid_70|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t62~0.offset=|v_ULTIMATE.start_main_~#t62~0.offset_23|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_29|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ULTIMATE.start_main_~#t62~0.base=|v_ULTIMATE.start_main_~#t62~0.base_32|, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t62~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t64~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t63~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t64~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t62~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:12:47,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff0_thd2~0_In71004450 ~z$r_buff1_thd2~0_Out71004450) (= ~__unbuffered_p0_EAX~0_Out71004450 ~x~0_In71004450) (= ~z$r_buff0_thd1~0_In71004450 ~z$r_buff1_thd1~0_Out71004450) (= 1 ~z$r_buff0_thd1~0_Out71004450) (= ~z$r_buff1_thd0~0_Out71004450 ~z$r_buff0_thd0~0_In71004450) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In71004450 0)) (= ~z$r_buff0_thd3~0_In71004450 ~z$r_buff1_thd3~0_Out71004450)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In71004450, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In71004450, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In71004450, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In71004450, ~x~0=~x~0_In71004450, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In71004450} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out71004450, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In71004450, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out71004450, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out71004450, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out71004450, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out71004450, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In71004450, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In71004450, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out71004450, ~x~0=~x~0_In71004450, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In71004450} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:12:47,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t63~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11|) |v_ULTIMATE.start_main_~#t63~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t63~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t63~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t63~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t63~0.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:12:47,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In263918599 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In263918599 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out263918599| |P1Thread1of1ForFork2_#t~ite9_Out263918599|))) (or (and (or .cse0 .cse1) (= ~z~0_In263918599 |P1Thread1of1ForFork2_#t~ite9_Out263918599|) .cse2) (and (= ~z$w_buff1~0_In263918599 |P1Thread1of1ForFork2_#t~ite9_Out263918599|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In263918599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In263918599, ~z$w_buff1~0=~z$w_buff1~0_In263918599, ~z~0=~z~0_In263918599} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out263918599|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In263918599, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out263918599|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In263918599, ~z$w_buff1~0=~z$w_buff1~0_In263918599, ~z~0=~z~0_In263918599} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:12:47,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1428313746 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1428313746 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1428313746| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1428313746| ~z$w_buff0_used~0_In-1428313746)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1428313746} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1428313746|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1428313746} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:12:47,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t64~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t64~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11|) |v_ULTIMATE.start_main_~#t64~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t64~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t64~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_11|, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t64~0.base, ULTIMATE.start_main_~#t64~0.offset, #length] because there is no mapped edge [2019-12-26 21:12:47,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-665034571 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-665034571 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-665034571|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-665034571 |P0Thread1of1ForFork1_#t~ite5_Out-665034571|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-665034571, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-665034571} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-665034571|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-665034571, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-665034571} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:12:47,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1699965945 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1699965945 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1699965945 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1699965945 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1699965945| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1699965945| ~z$w_buff1_used~0_In1699965945) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1699965945, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1699965945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699965945, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1699965945} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1699965945, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1699965945|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1699965945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699965945, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1699965945} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:12:47,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1539498019 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1539498019 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1539498019) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1539498019 ~z$r_buff0_thd1~0_Out-1539498019) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1539498019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1539498019|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1539498019} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:12:47,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In328413563 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In328413563 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In328413563 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In328413563 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out328413563| ~z$r_buff1_thd1~0_In328413563) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out328413563| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In328413563, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In328413563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328413563, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In328413563} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out328413563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In328413563, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In328413563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328413563, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In328413563} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:12:47,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:12:47,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1774198909 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1774198909 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1774198909 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1774198909 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1774198909| ~z$w_buff1_used~0_In-1774198909)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1774198909| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774198909, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1774198909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774198909, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1774198909} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774198909, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1774198909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774198909, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1774198909|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1774198909} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:12:47,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2115752483 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In2115752483 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out2115752483| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In2115752483 |P1Thread1of1ForFork2_#t~ite13_Out2115752483|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2115752483, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2115752483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2115752483, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2115752483|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2115752483} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:12:47,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In677168881 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In677168881 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In677168881 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In677168881 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out677168881| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In677168881 |P1Thread1of1ForFork2_#t~ite14_Out677168881|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In677168881, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In677168881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677168881, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In677168881} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In677168881, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In677168881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677168881, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out677168881|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In677168881} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:12:47,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:12:47,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1890345947 256) 0))) (or (and (= ~z$w_buff1_used~0_In1890345947 |P2Thread1of1ForFork0_#t~ite30_Out1890345947|) (= |P2Thread1of1ForFork0_#t~ite29_In1890345947| |P2Thread1of1ForFork0_#t~ite29_Out1890345947|) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1890345947 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1890345947 256))) (= 0 (mod ~z$w_buff0_used~0_In1890345947 256)) (and (= (mod ~z$r_buff1_thd3~0_In1890345947 256) 0) .cse1))) (= ~z$w_buff1_used~0_In1890345947 |P2Thread1of1ForFork0_#t~ite29_Out1890345947|) (= |P2Thread1of1ForFork0_#t~ite30_Out1890345947| |P2Thread1of1ForFork0_#t~ite29_Out1890345947|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1890345947, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1890345947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890345947, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1890345947, ~weak$$choice2~0=~weak$$choice2~0_In1890345947, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1890345947|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1890345947, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1890345947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890345947, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1890345947, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1890345947|, ~weak$$choice2~0=~weak$$choice2~0_In1890345947, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1890345947|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:12:47,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:12:47,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:12:47,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-638289171 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-638289171 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-638289171| ~z$w_buff1~0_In-638289171) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-638289171| ~z~0_In-638289171)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-638289171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-638289171, ~z$w_buff1~0=~z$w_buff1~0_In-638289171, ~z~0=~z~0_In-638289171} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-638289171|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-638289171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-638289171, ~z$w_buff1~0=~z$w_buff1~0_In-638289171, ~z~0=~z~0_In-638289171} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:12:47,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:12:47,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1147781208 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1147781208 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1147781208| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1147781208| ~z$w_buff0_used~0_In-1147781208) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1147781208|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:12:47,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1936061990 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1936061990 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1936061990 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1936061990 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1936061990 |P2Thread1of1ForFork0_#t~ite41_Out1936061990|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1936061990|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1936061990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1936061990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1936061990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1936061990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1936061990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1936061990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1936061990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1936061990, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1936061990|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:12:47,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1178105438 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1178105438 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1178105438|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1178105438| ~z$r_buff0_thd3~0_In1178105438) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1178105438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1178105438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1178105438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1178105438, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1178105438|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:12:47,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1309285719 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1309285719 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1309285719 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1309285719 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1309285719 |P2Thread1of1ForFork0_#t~ite43_Out1309285719|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1309285719|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1309285719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309285719, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1309285719} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1309285719|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1309285719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309285719, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1309285719} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:12:47,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:12:47,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:12:47,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1061431393| |ULTIMATE.start_main_#t~ite48_Out1061431393|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1061431393 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1061431393 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1061431393| ~z$w_buff1~0_In1061431393) .cse0 (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out1061431393| ~z~0_In1061431393) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1061431393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061431393, ~z$w_buff1~0=~z$w_buff1~0_In1061431393, ~z~0=~z~0_In1061431393} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1061431393, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1061431393|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061431393, ~z$w_buff1~0=~z$w_buff1~0_In1061431393, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1061431393|, ~z~0=~z~0_In1061431393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:12:47,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In85391335 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In85391335 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out85391335| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out85391335| ~z$w_buff0_used~0_In85391335)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In85391335, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In85391335, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out85391335|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:12:47,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1659374397 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1659374397 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1659374397 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1659374397 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1659374397| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1659374397 |ULTIMATE.start_main_#t~ite50_Out1659374397|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1659374397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1659374397, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1659374397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1659374397} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1659374397|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1659374397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1659374397, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1659374397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1659374397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:12:47,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1446542332 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1446542332 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1446542332|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1446542332 |ULTIMATE.start_main_#t~ite51_Out-1446542332|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1446542332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1446542332, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1446542332|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:12:47,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-67243437 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-67243437 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-67243437 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-67243437 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-67243437 |ULTIMATE.start_main_#t~ite52_Out-67243437|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-67243437|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-67243437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-67243437, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-67243437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-67243437} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-67243437|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-67243437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-67243437, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-67243437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-67243437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:12:47,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:12:47,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:12:47 BasicIcfg [2019-12-26 21:12:47,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:12:47,532 INFO L168 Benchmark]: Toolchain (without parser) took 132980.36 ms. Allocated memory was 145.8 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 102.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,533 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.23 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,538 INFO L168 Benchmark]: Boogie Preprocessor took 41.48 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,538 INFO L168 Benchmark]: RCFGBuilder took 928.84 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,539 INFO L168 Benchmark]: TraceAbstraction took 131117.14 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 100.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:47,540 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.23 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.48 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 928.84 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131117.14 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 100.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 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) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 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 [L775] 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 [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 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 [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 130.7s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 48.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10150 SDtfs, 12157 SDslu, 42102 SDs, 0 SdLazy, 30037 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 66 SyntacticMatches, 30 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 313601 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1955 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1849 ConstructedInterpolants, 0 QuantifiedInterpolants, 503951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...