/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/mix025_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:56:19,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:56:19,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:56:19,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:56:19,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:56:19,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:56:19,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:56:19,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:56:19,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:56:19,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:56:19,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:56:19,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:56:19,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:56:19,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:56:19,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:56:19,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:56:19,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:56:19,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:56:19,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:56:19,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:56:19,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:56:19,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:56:19,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:56:19,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:56:19,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:56:19,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:56:19,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:56:19,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:56:19,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:56:19,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:56:19,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:56:19,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:56:19,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:56:19,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:56:19,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:56:19,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:56:19,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:56:19,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:56:19,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:56:19,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:56:19,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:56:19,302 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-18 12:56:19,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:56:19,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:56:19,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:56:19,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:56:19,318 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:56:19,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:56:19,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:56:19,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:56:19,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:56:19,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:56:19,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:56:19,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:56:19,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:56:19,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:56:19,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:56:19,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:56:19,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:56:19,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:56:19,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:56:19,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:56:19,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:56:19,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:56:19,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:56:19,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:56:19,635 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:56:19,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-18 12:56:19,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d59638/498a040670ce4178ae8006131d4ca3fb/FLAG9c7c5f7e7 [2019-12-18 12:56:20,282 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:56:20,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-18 12:56:20,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d59638/498a040670ce4178ae8006131d4ca3fb/FLAG9c7c5f7e7 [2019-12-18 12:56:20,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d59638/498a040670ce4178ae8006131d4ca3fb [2019-12-18 12:56:20,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:56:20,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:56:20,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:20,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:56:20,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:56:20,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:20" (1/1) ... [2019-12-18 12:56:20,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da7a078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:20, skipping insertion in model container [2019-12-18 12:56:20,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:20" (1/1) ... [2019-12-18 12:56:20,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:56:20,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:56:21,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:21,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:56:21,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:21,291 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:56:21,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21 WrapperNode [2019-12-18 12:56:21,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:21,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:21,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:56:21,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:56:21,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:21,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:56:21,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:56:21,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:56:21,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... [2019-12-18 12:56:21,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:56:21,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:56:21,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:56:21,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:56:21,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:56:21,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:56:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:56:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:56:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:56:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:56:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:56:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:56:21,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:56:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:56:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:56:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:56:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:56:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:56:21,495 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:56:22,359 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:56:22,360 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:56:22,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:22 BoogieIcfgContainer [2019-12-18 12:56:22,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:56:22,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:56:22,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:56:22,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:56:22,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:56:20" (1/3) ... [2019-12-18 12:56:22,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3e8c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:22, skipping insertion in model container [2019-12-18 12:56:22,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:21" (2/3) ... [2019-12-18 12:56:22,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3e8c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:22, skipping insertion in model container [2019-12-18 12:56:22,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:22" (3/3) ... [2019-12-18 12:56:22,373 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.oepc.i [2019-12-18 12:56:22,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:56:22,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:56:22,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:56:22,396 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:56:22,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,456 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,504 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:22,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:56:22,553 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:56:22,554 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:56:22,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:56:22,554 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:56:22,554 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:56:22,554 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:56:22,554 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:56:22,554 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:56:22,571 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:56:22,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:56:22,657 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:56:22,657 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:22,676 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:56:22,704 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:56:22,783 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:56:22,783 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:22,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:56:22,819 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:56:22,820 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:56:28,065 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:56:28,188 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:56:28,444 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:56:28,444 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:56:28,448 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:56:50,313 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:56:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:56:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:56:50,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:50,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:56:50,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:56:50,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:50,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290628332] [2019-12-18 12:56:50,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:50,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290628332] [2019-12-18 12:56:50,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:50,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:56:50,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936673164] [2019-12-18 12:56:50,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:50,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:50,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:50,596 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:56:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:51,698 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:56:51,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:51,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:56:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:52,414 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:56:52,414 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:56:52,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:57:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:57:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:57:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:57:02,932 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:57:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:02,932 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:57:02,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:57:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:57:02,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:02,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:02,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:57:02,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:02,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943771484] [2019-12-18 12:57:02,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:03,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943771484] [2019-12-18 12:57:03,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:03,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:03,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970795175] [2019-12-18 12:57:03,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:03,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:03,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:03,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:03,065 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:57:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:08,473 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:57:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:08,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:57:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:09,074 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:57:09,074 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:57:09,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:57:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:57:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:57:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:57:24,262 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:57:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:24,262 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:57:24,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:57:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:57:24,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:24,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:24,269 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:24,269 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:57:24,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:24,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621370035] [2019-12-18 12:57:24,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:24,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621370035] [2019-12-18 12:57:24,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:24,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:24,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216646009] [2019-12-18 12:57:24,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:24,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:24,324 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:57:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:24,445 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:57:24,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:24,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:57:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:24,513 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:57:24,513 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:57:24,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:57:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:57:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:57:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:57:25,388 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:57:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:25,388 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:57:25,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:57:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:25,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:25,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:25,395 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:57:25,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:25,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113204769] [2019-12-18 12:57:25,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:25,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113204769] [2019-12-18 12:57:25,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:25,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:25,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640690951] [2019-12-18 12:57:25,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:25,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:25,526 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:57:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:27,256 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:57:27,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:27,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:57:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:27,376 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:57:27,376 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:57:27,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:57:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:57:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:57:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:57:28,497 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:57:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:28,499 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:57:28,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:57:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:28,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:28,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:28,506 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:57:28,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:28,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194485527] [2019-12-18 12:57:28,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194485527] [2019-12-18 12:57:28,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:28,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:28,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860819543] [2019-12-18 12:57:28,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:28,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:28,638 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:57:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:28,961 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:57:28,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:28,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:57:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:29,034 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:57:29,034 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:57:29,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:57:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:57:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:57:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:57:32,337 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:57:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:32,338 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:57:32,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:57:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:32,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:32,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:32,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:57:32,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:32,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407620439] [2019-12-18 12:57:32,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:32,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407620439] [2019-12-18 12:57:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:32,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731101282] [2019-12-18 12:57:32,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:32,436 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:57:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:32,840 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:57:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:32,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:57:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:32,939 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:57:32,939 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:57:32,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:57:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:57:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:57:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:57:34,193 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:57:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:34,193 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:57:34,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:57:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:57:34,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:34,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:34,207 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:34,207 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:57:34,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:34,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235903038] [2019-12-18 12:57:34,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:34,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235903038] [2019-12-18 12:57:34,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:34,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685296645] [2019-12-18 12:57:34,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:34,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:34,280 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:57:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:34,919 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:57:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:34,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:57:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:35,019 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:57:35,019 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:57:35,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:57:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:57:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:57:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:57:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:57:35,856 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:57:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:35,857 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:57:35,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:57:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:57:35,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:35,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:35,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:35,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:57:35,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:35,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701504965] [2019-12-18 12:57:35,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:35,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701504965] [2019-12-18 12:57:35,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:35,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:35,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505837411] [2019-12-18 12:57:35,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:35,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:35,933 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:57:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:36,926 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:57:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:36,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:57:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:37,030 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:57:37,030 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:57:37,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:57:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:57:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:57:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:57:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:57:37,907 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:57:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:37,908 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:57:37,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:57:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:57:37,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:37,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:37,920 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:57:37,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:37,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444866623] [2019-12-18 12:57:37,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:37,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444866623] [2019-12-18 12:57:37,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:37,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:37,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885859286] [2019-12-18 12:57:37,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:37,963 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:57:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:38,030 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:57:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:57:38,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:57:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:38,054 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:57:38,054 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:57:38,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:57:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:57:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:57:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:57:38,299 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:57:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:38,300 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:57:38,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:57:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:57:38,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:38,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:38,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:38,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:38,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:57:38,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:38,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235779166] [2019-12-18 12:57:38,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:38,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235779166] [2019-12-18 12:57:38,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:38,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304396292] [2019-12-18 12:57:38,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:38,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:38,386 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:57:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:38,942 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:57:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:38,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:57:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:38,974 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:57:38,975 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:57:38,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:57:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:57:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:57:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:57:39,263 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:57:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:39,263 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:57:39,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:57:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:57:39,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:39,278 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-18 12:57:39,278 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:57:39,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:39,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909520296] [2019-12-18 12:57:39,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:39,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909520296] [2019-12-18 12:57:39,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:39,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:39,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852659247] [2019-12-18 12:57:39,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:39,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:39,337 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:57:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:39,724 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:57:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:39,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:57:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:39,768 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:57:39,768 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:57:39,769 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-18 12:57:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:57:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:57:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:57:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:57:40,102 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:57:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:40,102 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:57:40,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:57:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:57:40,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:40,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:40,121 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:57:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490770183] [2019-12-18 12:57:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:40,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490770183] [2019-12-18 12:57:40,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:40,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:40,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643804093] [2019-12-18 12:57:40,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:40,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:40,207 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:57:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:40,905 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:57:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:40,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:57:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:40,947 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:57:40,948 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:57:40,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:57:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:57:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:57:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:57:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:57:41,289 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:57:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:41,290 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:57:41,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:57:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:57:41,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:41,312 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-18 12:57:41,312 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:57:41,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:41,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462724736] [2019-12-18 12:57:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:41,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462724736] [2019-12-18 12:57:41,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:41,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:41,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93586213] [2019-12-18 12:57:41,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:41,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:41,394 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:57:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:42,338 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:57:42,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:42,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:57:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:42,377 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:57:42,377 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:57:42,378 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-18 12:57:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:57:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:57:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:57:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:57:42,657 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:57:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:42,657 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:57:42,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:57:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:57:42,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:42,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:42,674 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:57:42,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:42,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070189539] [2019-12-18 12:57:42,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:42,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070189539] [2019-12-18 12:57:42,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:42,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:57:42,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59215281] [2019-12-18 12:57:42,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:42,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:42,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:42,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:42,733 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:57:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:42,805 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:57:42,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:42,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:57:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:42,842 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:57:42,842 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:57:42,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:57:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:57:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:57:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:57:43,126 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:57:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:43,126 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:57:43,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:57:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:57:43,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:43,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:43,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:57:43,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:43,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344137720] [2019-12-18 12:57:43,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:43,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344137720] [2019-12-18 12:57:43,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:43,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:57:43,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105786990] [2019-12-18 12:57:43,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:43,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:43,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:43,227 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:57:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:43,836 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:57:43,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:57:43,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:57:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:43,885 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:57:43,885 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:57:43,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:57:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:57:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:57:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:57:44,218 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:57:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:44,218 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:57:44,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:57:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:57:44,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:44,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:44,247 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:44,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:57:44,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:44,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951673038] [2019-12-18 12:57:44,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:44,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951673038] [2019-12-18 12:57:44,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:44,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:44,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204866979] [2019-12-18 12:57:44,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:44,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:44,308 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:57:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:44,417 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:57:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:44,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:57:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:44,457 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:57:44,457 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:57:44,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:57:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:57:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:57:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:57:45,109 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:57:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:45,110 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:57:45,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:57:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:45,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:45,139 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] [2019-12-18 12:57:45,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:57:45,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:45,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735352554] [2019-12-18 12:57:45,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:45,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735352554] [2019-12-18 12:57:45,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:45,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:45,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972529185] [2019-12-18 12:57:45,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:45,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:45,225 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:57:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:45,760 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:57:45,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:57:45,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:45,835 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:57:45,835 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:57:45,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:57:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:57:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:57:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:57:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:57:46,376 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:57:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:46,376 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:57:46,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:57:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:46,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:46,405 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] [2019-12-18 12:57:46,405 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:57:46,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:46,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100724831] [2019-12-18 12:57:46,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:46,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100724831] [2019-12-18 12:57:46,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:46,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000229851] [2019-12-18 12:57:46,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:46,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:46,503 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:57:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:47,180 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:57:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:47,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:47,285 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:57:47,285 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:57:47,287 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-18 12:57:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:57:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:57:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:57:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:57:48,442 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:57:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:57:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:57:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:48,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:48,479 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] [2019-12-18 12:57:48,479 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:57:48,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:48,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776757285] [2019-12-18 12:57:48,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:48,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776757285] [2019-12-18 12:57:48,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:48,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:48,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881940666] [2019-12-18 12:57:48,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:57:48,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:48,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:57:48,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:48,568 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:57:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:49,052 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:57:49,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:57:49,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:57:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:49,144 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:57:49,144 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:57:49,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:57:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:57:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:57:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:57:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:57:49,775 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:57:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:49,776 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:57:49,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:57:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:57:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:49,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:49,808 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] [2019-12-18 12:57:49,808 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:57:49,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:49,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505996682] [2019-12-18 12:57:49,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:49,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505996682] [2019-12-18 12:57:49,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:49,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:49,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035310002] [2019-12-18 12:57:49,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:57:49,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:57:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:57:49,978 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 9 states. [2019-12-18 12:57:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:51,399 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-18 12:57:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:57:51,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:57:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:51,454 INFO L225 Difference]: With dead ends: 38094 [2019-12-18 12:57:51,454 INFO L226 Difference]: Without dead ends: 37870 [2019-12-18 12:57:51,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:57:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-18 12:57:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-18 12:57:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-18 12:57:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-18 12:57:52,483 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-18 12:57:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:52,483 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-18 12:57:52,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:57:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-18 12:57:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:52,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:52,526 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] [2019-12-18 12:57:52,526 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 12:57:52,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:52,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709761074] [2019-12-18 12:57:52,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:52,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709761074] [2019-12-18 12:57:52,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:52,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:52,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906209870] [2019-12-18 12:57:52,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:52,635 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 8 states. [2019-12-18 12:57:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:54,162 INFO L93 Difference]: Finished difference Result 54976 states and 166682 transitions. [2019-12-18 12:57:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:57:54,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:54,242 INFO L225 Difference]: With dead ends: 54976 [2019-12-18 12:57:54,243 INFO L226 Difference]: Without dead ends: 54653 [2019-12-18 12:57:54,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:57:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54653 states. [2019-12-18 12:57:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54653 to 34658. [2019-12-18 12:57:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-12-18 12:57:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 107721 transitions. [2019-12-18 12:57:54,896 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 107721 transitions. Word has length 63 [2019-12-18 12:57:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:54,896 INFO L462 AbstractCegarLoop]: Abstraction has 34658 states and 107721 transitions. [2019-12-18 12:57:54,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 107721 transitions. [2019-12-18 12:57:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:54,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:54,936 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] [2019-12-18 12:57:54,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:54,936 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 12:57:54,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:54,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790637057] [2019-12-18 12:57:54,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:55,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790637057] [2019-12-18 12:57:55,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:55,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:57:55,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260002429] [2019-12-18 12:57:55,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:55,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:55,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:55,024 INFO L87 Difference]: Start difference. First operand 34658 states and 107721 transitions. Second operand 6 states. [2019-12-18 12:57:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:55,729 INFO L93 Difference]: Finished difference Result 57288 states and 175480 transitions. [2019-12-18 12:57:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:57:55,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-18 12:57:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:55,814 INFO L225 Difference]: With dead ends: 57288 [2019-12-18 12:57:55,814 INFO L226 Difference]: Without dead ends: 57068 [2019-12-18 12:57:55,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:57:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2019-12-18 12:57:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 40390. [2019-12-18 12:57:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40390 states. [2019-12-18 12:57:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40390 states to 40390 states and 125252 transitions. [2019-12-18 12:57:56,924 INFO L78 Accepts]: Start accepts. Automaton has 40390 states and 125252 transitions. Word has length 63 [2019-12-18 12:57:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:56,924 INFO L462 AbstractCegarLoop]: Abstraction has 40390 states and 125252 transitions. [2019-12-18 12:57:56,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:57:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40390 states and 125252 transitions. [2019-12-18 12:57:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:56,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:56,969 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] [2019-12-18 12:57:56,969 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:57:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 12:57:56,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:56,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331128795] [2019-12-18 12:57:56,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:57,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331128795] [2019-12-18 12:57:57,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:57,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:57:57,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869061219] [2019-12-18 12:57:57,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:57:57,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:57:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:57:57,100 INFO L87 Difference]: Start difference. First operand 40390 states and 125252 transitions. Second operand 8 states. [2019-12-18 12:57:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:58,538 INFO L93 Difference]: Finished difference Result 60008 states and 183321 transitions. [2019-12-18 12:57:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:57:58,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:57:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:58,626 INFO L225 Difference]: With dead ends: 60008 [2019-12-18 12:57:58,626 INFO L226 Difference]: Without dead ends: 59756 [2019-12-18 12:57:58,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:57:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-18 12:57:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40339. [2019-12-18 12:57:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40339 states. [2019-12-18 12:57:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40339 states to 40339 states and 125109 transitions. [2019-12-18 12:57:59,369 INFO L78 Accepts]: Start accepts. Automaton has 40339 states and 125109 transitions. Word has length 63 [2019-12-18 12:57:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:59,370 INFO L462 AbstractCegarLoop]: Abstraction has 40339 states and 125109 transitions. [2019-12-18 12:57:59,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:57:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 40339 states and 125109 transitions. [2019-12-18 12:57:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:57:59,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:59,414 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] [2019-12-18 12:57:59,414 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-18 12:57:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 12:57:59,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:59,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592716252] [2019-12-18 12:57:59,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:59,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592716252] [2019-12-18 12:57:59,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:59,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:57:59,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561225108] [2019-12-18 12:57:59,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:57:59,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:59,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:57:59,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:57:59,535 INFO L87 Difference]: Start difference. First operand 40339 states and 125109 transitions. Second operand 9 states. [2019-12-18 12:58:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:01,814 INFO L93 Difference]: Finished difference Result 58458 states and 177165 transitions. [2019-12-18 12:58:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:01,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:01,893 INFO L225 Difference]: With dead ends: 58458 [2019-12-18 12:58:01,894 INFO L226 Difference]: Without dead ends: 58458 [2019-12-18 12:58:01,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:58:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58458 states. [2019-12-18 12:58:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58458 to 39692. [2019-12-18 12:58:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39692 states. [2019-12-18 12:58:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 123217 transitions. [2019-12-18 12:58:02,623 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 123217 transitions. Word has length 63 [2019-12-18 12:58:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 39692 states and 123217 transitions. [2019-12-18 12:58:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 123217 transitions. [2019-12-18 12:58:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:02,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:02,670 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] [2019-12-18 12:58:02,670 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-18 12:58:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 12:58:02,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:02,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028257915] [2019-12-18 12:58:02,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:02,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028257915] [2019-12-18 12:58:02,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:02,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:02,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905594371] [2019-12-18 12:58:02,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:02,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:02,803 INFO L87 Difference]: Start difference. First operand 39692 states and 123217 transitions. Second operand 8 states. [2019-12-18 12:58:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:03,811 INFO L93 Difference]: Finished difference Result 55159 states and 169085 transitions. [2019-12-18 12:58:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:03,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:03,900 INFO L225 Difference]: With dead ends: 55159 [2019-12-18 12:58:03,901 INFO L226 Difference]: Without dead ends: 55159 [2019-12-18 12:58:03,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:58:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55159 states. [2019-12-18 12:58:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55159 to 38889. [2019-12-18 12:58:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38889 states. [2019-12-18 12:58:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38889 states to 38889 states and 120766 transitions. [2019-12-18 12:58:04,647 INFO L78 Accepts]: Start accepts. Automaton has 38889 states and 120766 transitions. Word has length 63 [2019-12-18 12:58:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:04,647 INFO L462 AbstractCegarLoop]: Abstraction has 38889 states and 120766 transitions. [2019-12-18 12:58:04,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38889 states and 120766 transitions. [2019-12-18 12:58:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:04,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:04,699 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] [2019-12-18 12:58:04,699 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-18 12:58:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 12:58:04,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:04,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457073196] [2019-12-18 12:58:04,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:04,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457073196] [2019-12-18 12:58:04,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:04,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:04,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645002823] [2019-12-18 12:58:04,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:04,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:04,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:04,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:04,833 INFO L87 Difference]: Start difference. First operand 38889 states and 120766 transitions. Second operand 9 states. [2019-12-18 12:58:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:06,619 INFO L93 Difference]: Finished difference Result 56103 states and 171957 transitions. [2019-12-18 12:58:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:58:06,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:06,718 INFO L225 Difference]: With dead ends: 56103 [2019-12-18 12:58:06,718 INFO L226 Difference]: Without dead ends: 56103 [2019-12-18 12:58:06,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:58:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56103 states. [2019-12-18 12:58:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56103 to 36616. [2019-12-18 12:58:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36616 states. [2019-12-18 12:58:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36616 states to 36616 states and 113998 transitions. [2019-12-18 12:58:07,488 INFO L78 Accepts]: Start accepts. Automaton has 36616 states and 113998 transitions. Word has length 63 [2019-12-18 12:58:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:07,488 INFO L462 AbstractCegarLoop]: Abstraction has 36616 states and 113998 transitions. [2019-12-18 12:58:07,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 36616 states and 113998 transitions. [2019-12-18 12:58:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:07,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:07,534 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] [2019-12-18 12:58:07,534 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-18 12:58:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-18 12:58:07,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:07,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405641996] [2019-12-18 12:58:07,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405641996] [2019-12-18 12:58:07,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:07,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:07,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871215072] [2019-12-18 12:58:07,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:07,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:07,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:07,642 INFO L87 Difference]: Start difference. First operand 36616 states and 113998 transitions. Second operand 6 states. [2019-12-18 12:58:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:08,574 INFO L93 Difference]: Finished difference Result 57418 states and 175676 transitions. [2019-12-18 12:58:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:58:08,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-18 12:58:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:08,661 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 12:58:08,662 INFO L226 Difference]: Without dead ends: 57418 [2019-12-18 12:58:08,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:58:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57418 states. [2019-12-18 12:58:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57418 to 39035. [2019-12-18 12:58:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-12-18 12:58:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 121312 transitions. [2019-12-18 12:58:09,362 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 121312 transitions. Word has length 63 [2019-12-18 12:58:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:09,362 INFO L462 AbstractCegarLoop]: Abstraction has 39035 states and 121312 transitions. [2019-12-18 12:58:09,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 121312 transitions. [2019-12-18 12:58:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:09,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:09,403 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] [2019-12-18 12:58:09,404 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-18 12:58:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-18 12:58:09,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:09,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973295066] [2019-12-18 12:58:09,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:09,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973295066] [2019-12-18 12:58:09,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:09,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:09,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123810506] [2019-12-18 12:58:09,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:09,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:09,508 INFO L87 Difference]: Start difference. First operand 39035 states and 121312 transitions. Second operand 7 states. [2019-12-18 12:58:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:10,863 INFO L93 Difference]: Finished difference Result 57209 states and 175096 transitions. [2019-12-18 12:58:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:10,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:10,949 INFO L225 Difference]: With dead ends: 57209 [2019-12-18 12:58:10,949 INFO L226 Difference]: Without dead ends: 57209 [2019-12-18 12:58:10,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:58:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57209 states. [2019-12-18 12:58:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57209 to 37148. [2019-12-18 12:58:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-12-18 12:58:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 115695 transitions. [2019-12-18 12:58:11,622 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 115695 transitions. Word has length 63 [2019-12-18 12:58:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:11,623 INFO L462 AbstractCegarLoop]: Abstraction has 37148 states and 115695 transitions. [2019-12-18 12:58:11,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 115695 transitions. [2019-12-18 12:58:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:11,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:11,661 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] [2019-12-18 12:58:11,661 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-18 12:58:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-18 12:58:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:11,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713372680] [2019-12-18 12:58:11,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:11,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713372680] [2019-12-18 12:58:11,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:11,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:11,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210109833] [2019-12-18 12:58:11,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:11,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:11,781 INFO L87 Difference]: Start difference. First operand 37148 states and 115695 transitions. Second operand 9 states. [2019-12-18 12:58:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:13,509 INFO L93 Difference]: Finished difference Result 72816 states and 221017 transitions. [2019-12-18 12:58:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:58:13,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:13,622 INFO L225 Difference]: With dead ends: 72816 [2019-12-18 12:58:13,622 INFO L226 Difference]: Without dead ends: 72548 [2019-12-18 12:58:13,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:58:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72548 states. [2019-12-18 12:58:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72548 to 37598. [2019-12-18 12:58:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37598 states. [2019-12-18 12:58:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 117247 transitions. [2019-12-18 12:58:15,070 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 117247 transitions. Word has length 63 [2019-12-18 12:58:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:15,070 INFO L462 AbstractCegarLoop]: Abstraction has 37598 states and 117247 transitions. [2019-12-18 12:58:15,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 117247 transitions. [2019-12-18 12:58:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:15,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:15,112 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] [2019-12-18 12:58:15,112 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-18 12:58:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-18 12:58:15,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:15,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258537843] [2019-12-18 12:58:15,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:15,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258537843] [2019-12-18 12:58:15,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:15,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:15,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736956204] [2019-12-18 12:58:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:15,226 INFO L87 Difference]: Start difference. First operand 37598 states and 117247 transitions. Second operand 8 states. [2019-12-18 12:58:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:16,197 INFO L93 Difference]: Finished difference Result 52221 states and 160353 transitions. [2019-12-18 12:58:16,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:58:16,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:16,279 INFO L225 Difference]: With dead ends: 52221 [2019-12-18 12:58:16,279 INFO L226 Difference]: Without dead ends: 52165 [2019-12-18 12:58:16,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:58:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52165 states. [2019-12-18 12:58:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52165 to 37418. [2019-12-18 12:58:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37418 states. [2019-12-18 12:58:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37418 states to 37418 states and 115770 transitions. [2019-12-18 12:58:16,924 INFO L78 Accepts]: Start accepts. Automaton has 37418 states and 115770 transitions. Word has length 63 [2019-12-18 12:58:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:16,924 INFO L462 AbstractCegarLoop]: Abstraction has 37418 states and 115770 transitions. [2019-12-18 12:58:16,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37418 states and 115770 transitions. [2019-12-18 12:58:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:16,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:16,962 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-18 12:58:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-18 12:58:16,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:16,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175857231] [2019-12-18 12:58:16,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:17,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175857231] [2019-12-18 12:58:17,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:17,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:17,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706832347] [2019-12-18 12:58:17,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:17,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:17,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:17,062 INFO L87 Difference]: Start difference. First operand 37418 states and 115770 transitions. Second operand 7 states. [2019-12-18 12:58:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:18,216 INFO L93 Difference]: Finished difference Result 55724 states and 170978 transitions. [2019-12-18 12:58:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:18,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:18,318 INFO L225 Difference]: With dead ends: 55724 [2019-12-18 12:58:18,318 INFO L226 Difference]: Without dead ends: 55724 [2019-12-18 12:58:18,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:58:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55724 states. [2019-12-18 12:58:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55724 to 39999. [2019-12-18 12:58:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39999 states. [2019-12-18 12:58:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39999 states to 39999 states and 123988 transitions. [2019-12-18 12:58:19,036 INFO L78 Accepts]: Start accepts. Automaton has 39999 states and 123988 transitions. Word has length 63 [2019-12-18 12:58:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:19,036 INFO L462 AbstractCegarLoop]: Abstraction has 39999 states and 123988 transitions. [2019-12-18 12:58:19,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 39999 states and 123988 transitions. [2019-12-18 12:58:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:19,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:19,081 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] [2019-12-18 12:58:19,082 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-18 12:58:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 16 times [2019-12-18 12:58:19,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:19,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521966574] [2019-12-18 12:58:19,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:19,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521966574] [2019-12-18 12:58:19,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:19,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:19,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730687920] [2019-12-18 12:58:19,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:19,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:19,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:19,176 INFO L87 Difference]: Start difference. First operand 39999 states and 123988 transitions. Second operand 7 states. [2019-12-18 12:58:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:20,567 INFO L93 Difference]: Finished difference Result 61056 states and 186419 transitions. [2019-12-18 12:58:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:20,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:20,660 INFO L225 Difference]: With dead ends: 61056 [2019-12-18 12:58:20,660 INFO L226 Difference]: Without dead ends: 61056 [2019-12-18 12:58:20,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:58:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61056 states. [2019-12-18 12:58:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61056 to 40797. [2019-12-18 12:58:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40797 states. [2019-12-18 12:58:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40797 states to 40797 states and 126265 transitions. [2019-12-18 12:58:21,409 INFO L78 Accepts]: Start accepts. Automaton has 40797 states and 126265 transitions. Word has length 63 [2019-12-18 12:58:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:21,410 INFO L462 AbstractCegarLoop]: Abstraction has 40797 states and 126265 transitions. [2019-12-18 12:58:21,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 40797 states and 126265 transitions. [2019-12-18 12:58:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:21,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:21,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:21,453 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-18 12:58:21,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:21,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 17 times [2019-12-18 12:58:21,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:21,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151377916] [2019-12-18 12:58:21,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:21,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-18 12:58:21,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151377916] [2019-12-18 12:58:21,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:21,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:21,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798433977] [2019-12-18 12:58:21,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:21,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:21,597 INFO L87 Difference]: Start difference. First operand 40797 states and 126265 transitions. Second operand 9 states. [2019-12-18 12:58:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:23,006 INFO L93 Difference]: Finished difference Result 61113 states and 186560 transitions. [2019-12-18 12:58:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:58:23,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:23,104 INFO L225 Difference]: With dead ends: 61113 [2019-12-18 12:58:23,104 INFO L226 Difference]: Without dead ends: 61113 [2019-12-18 12:58:23,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:58:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61113 states. [2019-12-18 12:58:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61113 to 39655. [2019-12-18 12:58:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39655 states. [2019-12-18 12:58:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39655 states to 39655 states and 122975 transitions. [2019-12-18 12:58:23,889 INFO L78 Accepts]: Start accepts. Automaton has 39655 states and 122975 transitions. Word has length 63 [2019-12-18 12:58:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:23,889 INFO L462 AbstractCegarLoop]: Abstraction has 39655 states and 122975 transitions. [2019-12-18 12:58:23,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39655 states and 122975 transitions. [2019-12-18 12:58:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:24,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:24,469 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] [2019-12-18 12:58:24,469 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-18 12:58:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1012741715, now seen corresponding path program 18 times [2019-12-18 12:58:24,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:24,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246297388] [2019-12-18 12:58:24,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:24,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246297388] [2019-12-18 12:58:24,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:24,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:24,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131546060] [2019-12-18 12:58:24,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:24,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:24,529 INFO L87 Difference]: Start difference. First operand 39655 states and 122975 transitions. Second operand 3 states. [2019-12-18 12:58:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:24,675 INFO L93 Difference]: Finished difference Result 39654 states and 122973 transitions. [2019-12-18 12:58:24,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:24,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:58:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:24,742 INFO L225 Difference]: With dead ends: 39654 [2019-12-18 12:58:24,743 INFO L226 Difference]: Without dead ends: 39654 [2019-12-18 12:58:24,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39654 states. [2019-12-18 12:58:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39654 to 32690. [2019-12-18 12:58:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-12-18 12:58:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 102235 transitions. [2019-12-18 12:58:25,353 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 102235 transitions. Word has length 63 [2019-12-18 12:58:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:25,354 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 102235 transitions. [2019-12-18 12:58:25,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 102235 transitions. [2019-12-18 12:58:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:58:25,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:25,392 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-18 12:58:25,393 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-18 12:58:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-18 12:58:25,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:25,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14698806] [2019-12-18 12:58:25,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:25,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14698806] [2019-12-18 12:58:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:25,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:25,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590687955] [2019-12-18 12:58:25,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:25,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:25,463 INFO L87 Difference]: Start difference. First operand 32690 states and 102235 transitions. Second operand 3 states. [2019-12-18 12:58:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:25,541 INFO L93 Difference]: Finished difference Result 24805 states and 76665 transitions. [2019-12-18 12:58:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:25,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:58:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:25,578 INFO L225 Difference]: With dead ends: 24805 [2019-12-18 12:58:25,579 INFO L226 Difference]: Without dead ends: 24805 [2019-12-18 12:58:25,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24805 states. [2019-12-18 12:58:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24805 to 23051. [2019-12-18 12:58:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23051 states. [2019-12-18 12:58:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 71181 transitions. [2019-12-18 12:58:25,929 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 71181 transitions. Word has length 64 [2019-12-18 12:58:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:25,929 INFO L462 AbstractCegarLoop]: Abstraction has 23051 states and 71181 transitions. [2019-12-18 12:58:25,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 71181 transitions. [2019-12-18 12:58:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:25,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:25,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:25,957 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-18 12:58:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-18 12:58:25,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:25,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717993027] [2019-12-18 12:58:25,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:26,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717993027] [2019-12-18 12:58:26,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:26,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:26,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818347148] [2019-12-18 12:58:26,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:26,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:26,033 INFO L87 Difference]: Start difference. First operand 23051 states and 71181 transitions. Second operand 6 states. [2019-12-18 12:58:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:26,823 INFO L93 Difference]: Finished difference Result 31959 states and 97303 transitions. [2019-12-18 12:58:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:58:26,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 12:58:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:26,875 INFO L225 Difference]: With dead ends: 31959 [2019-12-18 12:58:26,875 INFO L226 Difference]: Without dead ends: 31959 [2019-12-18 12:58:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31959 states. [2019-12-18 12:58:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31959 to 24235. [2019-12-18 12:58:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24235 states. [2019-12-18 12:58:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24235 states to 24235 states and 74721 transitions. [2019-12-18 12:58:27,340 INFO L78 Accepts]: Start accepts. Automaton has 24235 states and 74721 transitions. Word has length 65 [2019-12-18 12:58:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:27,340 INFO L462 AbstractCegarLoop]: Abstraction has 24235 states and 74721 transitions. [2019-12-18 12:58:27,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24235 states and 74721 transitions. [2019-12-18 12:58:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:27,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:27,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:27,378 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-18 12:58:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-18 12:58:27,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:27,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762376164] [2019-12-18 12:58:27,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:27,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-18 12:58:27,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762376164] [2019-12-18 12:58:27,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:27,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:27,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369550867] [2019-12-18 12:58:27,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:27,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:27,489 INFO L87 Difference]: Start difference. First operand 24235 states and 74721 transitions. Second operand 8 states. [2019-12-18 12:58:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:29,434 INFO L93 Difference]: Finished difference Result 32735 states and 99302 transitions. [2019-12-18 12:58:29,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:58:29,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:58:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:29,481 INFO L225 Difference]: With dead ends: 32735 [2019-12-18 12:58:29,481 INFO L226 Difference]: Without dead ends: 32735 [2019-12-18 12:58:29,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:58:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32735 states. [2019-12-18 12:58:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32735 to 23590. [2019-12-18 12:58:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23590 states. [2019-12-18 12:58:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23590 states to 23590 states and 72809 transitions. [2019-12-18 12:58:29,881 INFO L78 Accepts]: Start accepts. Automaton has 23590 states and 72809 transitions. Word has length 65 [2019-12-18 12:58:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:29,881 INFO L462 AbstractCegarLoop]: Abstraction has 23590 states and 72809 transitions. [2019-12-18 12:58:29,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23590 states and 72809 transitions. [2019-12-18 12:58:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:29,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:29,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:29,905 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-18 12:58:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 903189921, now seen corresponding path program 3 times [2019-12-18 12:58:29,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:29,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278978495] [2019-12-18 12:58:29,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:30,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278978495] [2019-12-18 12:58:30,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:30,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:30,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156332327] [2019-12-18 12:58:30,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:58:30,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:58:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:58:30,073 INFO L87 Difference]: Start difference. First operand 23590 states and 72809 transitions. Second operand 10 states. [2019-12-18 12:58:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:31,387 INFO L93 Difference]: Finished difference Result 33927 states and 104100 transitions. [2019-12-18 12:58:31,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:58:31,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:58:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:31,431 INFO L225 Difference]: With dead ends: 33927 [2019-12-18 12:58:31,431 INFO L226 Difference]: Without dead ends: 27801 [2019-12-18 12:58:31,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:58:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27801 states. [2019-12-18 12:58:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27801 to 24021. [2019-12-18 12:58:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24021 states. [2019-12-18 12:58:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24021 states to 24021 states and 73954 transitions. [2019-12-18 12:58:31,791 INFO L78 Accepts]: Start accepts. Automaton has 24021 states and 73954 transitions. Word has length 65 [2019-12-18 12:58:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:31,791 INFO L462 AbstractCegarLoop]: Abstraction has 24021 states and 73954 transitions. [2019-12-18 12:58:31,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:58:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24021 states and 73954 transitions. [2019-12-18 12:58:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:31,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:31,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:31,815 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-18 12:58:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash 416369971, now seen corresponding path program 4 times [2019-12-18 12:58:31,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:31,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896708193] [2019-12-18 12:58:31,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:32,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896708193] [2019-12-18 12:58:32,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:32,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:32,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428640742] [2019-12-18 12:58:32,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:32,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:32,023 INFO L87 Difference]: Start difference. First operand 24021 states and 73954 transitions. Second operand 11 states. [2019-12-18 12:58:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:33,508 INFO L93 Difference]: Finished difference Result 33731 states and 102553 transitions. [2019-12-18 12:58:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:58:33,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:33,551 INFO L225 Difference]: With dead ends: 33731 [2019-12-18 12:58:33,551 INFO L226 Difference]: Without dead ends: 29309 [2019-12-18 12:58:33,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:58:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29309 states. [2019-12-18 12:58:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29309 to 24195. [2019-12-18 12:58:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24195 states. [2019-12-18 12:58:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24195 states to 24195 states and 74185 transitions. [2019-12-18 12:58:33,936 INFO L78 Accepts]: Start accepts. Automaton has 24195 states and 74185 transitions. Word has length 65 [2019-12-18 12:58:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:33,937 INFO L462 AbstractCegarLoop]: Abstraction has 24195 states and 74185 transitions. [2019-12-18 12:58:33,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24195 states and 74185 transitions. [2019-12-18 12:58:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:33,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:33,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:33,966 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-18 12:58:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1050757295, now seen corresponding path program 5 times [2019-12-18 12:58:33,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:33,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478779563] [2019-12-18 12:58:33,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:34,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478779563] [2019-12-18 12:58:34,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:34,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:58:34,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747197469] [2019-12-18 12:58:34,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:58:34,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:58:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:34,293 INFO L87 Difference]: Start difference. First operand 24195 states and 74185 transitions. Second operand 15 states. [2019-12-18 12:58:35,054 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-18 12:58:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:39,075 INFO L93 Difference]: Finished difference Result 56897 states and 172328 transitions. [2019-12-18 12:58:39,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 12:58:39,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-18 12:58:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:39,160 INFO L225 Difference]: With dead ends: 56897 [2019-12-18 12:58:39,161 INFO L226 Difference]: Without dead ends: 53989 [2019-12-18 12:58:39,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=562, Invalid=3220, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 12:58:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53989 states. [2019-12-18 12:58:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53989 to 28148. [2019-12-18 12:58:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28148 states. [2019-12-18 12:58:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28148 states to 28148 states and 85779 transitions. [2019-12-18 12:58:39,774 INFO L78 Accepts]: Start accepts. Automaton has 28148 states and 85779 transitions. Word has length 65 [2019-12-18 12:58:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:39,774 INFO L462 AbstractCegarLoop]: Abstraction has 28148 states and 85779 transitions. [2019-12-18 12:58:39,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:58:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28148 states and 85779 transitions. [2019-12-18 12:58:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:39,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:39,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:39,804 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 6 times [2019-12-18 12:58:39,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:39,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091871054] [2019-12-18 12:58:39,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:40,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091871054] [2019-12-18 12:58:40,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:40,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:58:40,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891081091] [2019-12-18 12:58:40,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:58:40,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:58:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:40,122 INFO L87 Difference]: Start difference. First operand 28148 states and 85779 transitions. Second operand 15 states. [2019-12-18 12:58:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:44,356 INFO L93 Difference]: Finished difference Result 54564 states and 163861 transitions. [2019-12-18 12:58:44,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 12:58:44,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-18 12:58:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:44,422 INFO L225 Difference]: With dead ends: 54564 [2019-12-18 12:58:44,422 INFO L226 Difference]: Without dead ends: 45226 [2019-12-18 12:58:44,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=476, Invalid=2176, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 12:58:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45226 states. [2019-12-18 12:58:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45226 to 24087. [2019-12-18 12:58:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24087 states. [2019-12-18 12:58:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24087 states to 24087 states and 73755 transitions. [2019-12-18 12:58:44,947 INFO L78 Accepts]: Start accepts. Automaton has 24087 states and 73755 transitions. Word has length 65 [2019-12-18 12:58:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:44,947 INFO L462 AbstractCegarLoop]: Abstraction has 24087 states and 73755 transitions. [2019-12-18 12:58:44,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:58:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 24087 states and 73755 transitions. [2019-12-18 12:58:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:44,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:44,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, 1] [2019-12-18 12:58:44,979 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash -131369463, now seen corresponding path program 7 times [2019-12-18 12:58:44,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:44,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571106878] [2019-12-18 12:58:44,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:45,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571106878] [2019-12-18 12:58:45,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:45,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:45,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553446895] [2019-12-18 12:58:45,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:45,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:45,152 INFO L87 Difference]: Start difference. First operand 24087 states and 73755 transitions. Second operand 11 states. [2019-12-18 12:58:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:46,334 INFO L93 Difference]: Finished difference Result 31213 states and 94692 transitions. [2019-12-18 12:58:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:58:46,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:46,374 INFO L225 Difference]: With dead ends: 31213 [2019-12-18 12:58:46,374 INFO L226 Difference]: Without dead ends: 27147 [2019-12-18 12:58:46,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:58:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2019-12-18 12:58:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 23967. [2019-12-18 12:58:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23967 states. [2019-12-18 12:58:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23967 states to 23967 states and 73397 transitions. [2019-12-18 12:58:46,717 INFO L78 Accepts]: Start accepts. Automaton has 23967 states and 73397 transitions. Word has length 65 [2019-12-18 12:58:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:46,717 INFO L462 AbstractCegarLoop]: Abstraction has 23967 states and 73397 transitions. [2019-12-18 12:58:46,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23967 states and 73397 transitions. [2019-12-18 12:58:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:46,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:46,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:46,746 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash 979273527, now seen corresponding path program 8 times [2019-12-18 12:58:46,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:46,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887371036] [2019-12-18 12:58:46,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887371036] [2019-12-18 12:58:47,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:47,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:58:47,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519383506] [2019-12-18 12:58:47,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:58:47,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:58:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:58:47,094 INFO L87 Difference]: Start difference. First operand 23967 states and 73397 transitions. Second operand 16 states. [2019-12-18 12:58:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:52,243 INFO L93 Difference]: Finished difference Result 49070 states and 148769 transitions. [2019-12-18 12:58:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 12:58:52,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-18 12:58:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:52,309 INFO L225 Difference]: With dead ends: 49070 [2019-12-18 12:58:52,310 INFO L226 Difference]: Without dead ends: 47757 [2019-12-18 12:58:52,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2702, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 12:58:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47757 states. [2019-12-18 12:58:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47757 to 26937. [2019-12-18 12:58:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26937 states. [2019-12-18 12:58:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26937 states to 26937 states and 82044 transitions. [2019-12-18 12:58:52,829 INFO L78 Accepts]: Start accepts. Automaton has 26937 states and 82044 transitions. Word has length 65 [2019-12-18 12:58:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:52,829 INFO L462 AbstractCegarLoop]: Abstraction has 26937 states and 82044 transitions. [2019-12-18 12:58:52,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:58:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 26937 states and 82044 transitions. [2019-12-18 12:58:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:52,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:52,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:52,861 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1699156151, now seen corresponding path program 9 times [2019-12-18 12:58:52,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:52,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924353448] [2019-12-18 12:58:52,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:53,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924353448] [2019-12-18 12:58:53,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:53,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:53,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534436743] [2019-12-18 12:58:53,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:53,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:53,008 INFO L87 Difference]: Start difference. First operand 26937 states and 82044 transitions. Second operand 11 states. [2019-12-18 12:58:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:54,319 INFO L93 Difference]: Finished difference Result 50220 states and 153221 transitions. [2019-12-18 12:58:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:58:54,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:54,377 INFO L225 Difference]: With dead ends: 50220 [2019-12-18 12:58:54,377 INFO L226 Difference]: Without dead ends: 38991 [2019-12-18 12:58:54,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:58:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38991 states. [2019-12-18 12:58:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38991 to 22888. [2019-12-18 12:58:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22888 states. [2019-12-18 12:58:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 70101 transitions. [2019-12-18 12:58:54,807 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 70101 transitions. Word has length 65 [2019-12-18 12:58:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:54,808 INFO L462 AbstractCegarLoop]: Abstraction has 22888 states and 70101 transitions. [2019-12-18 12:58:54,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 70101 transitions. [2019-12-18 12:58:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:54,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:54,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:54,830 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 10 times [2019-12-18 12:58:54,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:54,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935464338] [2019-12-18 12:58:54,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:54,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935464338] [2019-12-18 12:58:54,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:54,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:54,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861330026] [2019-12-18 12:58:54,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:54,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:54,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:54,902 INFO L87 Difference]: Start difference. First operand 22888 states and 70101 transitions. Second operand 4 states. [2019-12-18 12:58:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:55,048 INFO L93 Difference]: Finished difference Result 27598 states and 84220 transitions. [2019-12-18 12:58:55,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:55,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:58:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:55,085 INFO L225 Difference]: With dead ends: 27598 [2019-12-18 12:58:55,085 INFO L226 Difference]: Without dead ends: 27598 [2019-12-18 12:58:55,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27598 states. [2019-12-18 12:58:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27598 to 23004. [2019-12-18 12:58:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-12-18 12:58:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 70659 transitions. [2019-12-18 12:58:55,425 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 70659 transitions. Word has length 65 [2019-12-18 12:58:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:55,426 INFO L462 AbstractCegarLoop]: Abstraction has 23004 states and 70659 transitions. [2019-12-18 12:58:55,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 70659 transitions. [2019-12-18 12:58:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:58:55,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:55,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:55,448 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-18 12:58:55,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:55,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762304893] [2019-12-18 12:58:55,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:55,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762304893] [2019-12-18 12:58:55,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:55,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:58:55,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579383190] [2019-12-18 12:58:55,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:58:55,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:55,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:58:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:55,620 INFO L87 Difference]: Start difference. First operand 23004 states and 70659 transitions. Second operand 12 states. [2019-12-18 12:58:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:56,849 INFO L93 Difference]: Finished difference Result 39426 states and 121155 transitions. [2019-12-18 12:58:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:56,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:58:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:56,907 INFO L225 Difference]: With dead ends: 39426 [2019-12-18 12:58:56,908 INFO L226 Difference]: Without dead ends: 38951 [2019-12-18 12:58:56,908 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-18 12:58:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38951 states. [2019-12-18 12:58:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38951 to 22736. [2019-12-18 12:58:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22736 states. [2019-12-18 12:58:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22736 states to 22736 states and 69971 transitions. [2019-12-18 12:58:57,355 INFO L78 Accepts]: Start accepts. Automaton has 22736 states and 69971 transitions. Word has length 66 [2019-12-18 12:58:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:57,355 INFO L462 AbstractCegarLoop]: Abstraction has 22736 states and 69971 transitions. [2019-12-18 12:58:57,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:58:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22736 states and 69971 transitions. [2019-12-18 12:58:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:58:57,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:57,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:57,383 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-18 12:58:57,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:57,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100764773] [2019-12-18 12:58:57,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:58:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:58:57,516 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:58:57,516 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:58:57,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t669~0.base_22| 4)) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22| 1) |v_#valid_69|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22|)) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t669~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22|) |v_ULTIMATE.start_main_~#t669~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t669~0.base_22|) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t669~0.base=|v_ULTIMATE.start_main_~#t669~0.base_22|, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~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_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t669~0.offset=|v_ULTIMATE.start_main_~#t669~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.base, ~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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t670~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t670~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t669~0.base, ~x~0, ULTIMATE.start_main_~#t671~0.offset, ~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, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t669~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:58:57,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} 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-18 12:58:57,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11|) |v_ULTIMATE.start_main_~#t670~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t670~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t670~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t670~0.base_11|) (= |v_ULTIMATE.start_main_~#t670~0.offset_10| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t670~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t670~0.offset] because there is no mapped edge [2019-12-18 12:58:57,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t671~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t671~0.base_12| 4)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t671~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12|) |v_ULTIMATE.start_main_~#t671~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t671~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.offset, ULTIMATE.start_main_~#t671~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:58:57,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In530036252 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In530036252 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out530036252| |P1Thread1of1ForFork2_#t~ite9_Out530036252|))) (or (and (not .cse0) (= ~z$w_buff1~0_In530036252 |P1Thread1of1ForFork2_#t~ite9_Out530036252|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~z~0_In530036252 |P1Thread1of1ForFork2_#t~ite9_Out530036252|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In530036252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In530036252, ~z$w_buff1~0=~z$w_buff1~0_In530036252, ~z~0=~z~0_In530036252} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out530036252|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In530036252, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out530036252|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In530036252, ~z$w_buff1~0=~z$w_buff1~0_In530036252, ~z~0=~z~0_In530036252} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:58:57,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1611395391 256)))) (or (and (= ~z$w_buff1~0_In-1611395391 |P2Thread1of1ForFork0_#t~ite23_Out-1611395391|) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1611395391| |P2Thread1of1ForFork0_#t~ite23_Out-1611395391|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1611395391 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1611395391 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1611395391 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1611395391 256))))) (and (= ~z$w_buff1~0_In-1611395391 |P2Thread1of1ForFork0_#t~ite24_Out-1611395391|) (= |P2Thread1of1ForFork0_#t~ite23_In-1611395391| |P2Thread1of1ForFork0_#t~ite23_Out-1611395391|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1611395391, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1611395391, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1611395391|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1611395391, ~z$w_buff1~0=~z$w_buff1~0_In-1611395391, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1611395391, ~weak$$choice2~0=~weak$$choice2~0_In-1611395391} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1611395391, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1611395391|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1611395391, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1611395391|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1611395391, ~z$w_buff1~0=~z$w_buff1~0_In-1611395391, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1611395391, ~weak$$choice2~0=~weak$$choice2~0_In-1611395391} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:58:57,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= |P2Thread1of1ForFork0_#t~ite30_Out1970441736| |P2Thread1of1ForFork0_#t~ite29_Out1970441736|)) (.cse0 (= (mod ~z$w_buff1_used~0_In1970441736 256) 0)) (.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In1970441736 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In1970441736 256))) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In1970441736 256))) (.cse2 (= 0 (mod ~weak$$choice2~0_In1970441736 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1970441736| 0) (= |P2Thread1of1ForFork0_#t~ite28_Out1970441736| |P2Thread1of1ForFork0_#t~ite29_Out1970441736|) .cse2 .cse3 (not .cse4) (or (not .cse5) .cse1))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1970441736| ~z$w_buff1_used~0_In1970441736) .cse3 .cse2 (or (and .cse0 .cse6) (and .cse5 .cse6) .cse4)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1970441736| |P2Thread1of1ForFork0_#t~ite29_Out1970441736|) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite30_Out1970441736| ~z$w_buff1_used~0_In1970441736))) (= |P2Thread1of1ForFork0_#t~ite28_In1970441736| |P2Thread1of1ForFork0_#t~ite28_Out1970441736|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1970441736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970441736, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1970441736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970441736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1970441736, ~weak$$choice2~0=~weak$$choice2~0_In1970441736, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1970441736|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1970441736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970441736, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1970441736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970441736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1970441736, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1970441736|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1970441736|, ~weak$$choice2~0=~weak$$choice2~0_In1970441736} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:58:57,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:58:57,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:58:57,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out663408297| |P2Thread1of1ForFork0_#t~ite38_Out663408297|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In663408297 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In663408297 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out663408297| ~z~0_In663408297) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out663408297| ~z$w_buff1~0_In663408297) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In663408297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In663408297, ~z$w_buff1~0=~z$w_buff1~0_In663408297, ~z~0=~z~0_In663408297} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out663408297|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out663408297|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In663408297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In663408297, ~z$w_buff1~0=~z$w_buff1~0_In663408297, ~z~0=~z~0_In663408297} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:58:57,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1512269724 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1512269724 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1512269724| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1512269724| ~z$w_buff0_used~0_In-1512269724) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1512269724, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1512269724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1512269724, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1512269724|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1512269724} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:58:57,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-479514199 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-479514199 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-479514199 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-479514199 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-479514199|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-479514199 |P2Thread1of1ForFork0_#t~ite41_Out-479514199|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-479514199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-479514199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-479514199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-479514199} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-479514199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-479514199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-479514199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-479514199, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-479514199|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:58:57,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-440514185 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-440514185 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-440514185|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-440514185 |P2Thread1of1ForFork0_#t~ite42_Out-440514185|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-440514185, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-440514185} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-440514185, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-440514185, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-440514185|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:58:57,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In984884000 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In984884000 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In984884000 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In984884000 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out984884000| ~z$r_buff1_thd3~0_In984884000)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out984884000| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In984884000, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In984884000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In984884000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In984884000} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out984884000|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In984884000, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In984884000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In984884000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In984884000} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:58:57,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, 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-18 12:58:57,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-142998919 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-142998919 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-142998919|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-142998919 |P0Thread1of1ForFork1_#t~ite5_Out-142998919|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-142998919, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-142998919} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-142998919|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-142998919, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-142998919} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:58:57,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In2127609782 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2127609782 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2127609782 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In2127609782 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2127609782|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2127609782 |P0Thread1of1ForFork1_#t~ite6_Out2127609782|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2127609782, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2127609782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2127609782, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2127609782} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2127609782, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2127609782|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2127609782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2127609782, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2127609782} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:58:57,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1693557771 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693557771 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1693557771) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1693557771 ~z$r_buff0_thd1~0_Out-1693557771)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693557771, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1693557771} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693557771, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1693557771|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1693557771} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:58:57,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In552762795 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In552762795 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In552762795 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In552762795 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out552762795| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out552762795| ~z$r_buff1_thd1~0_In552762795)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In552762795, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In552762795, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552762795, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In552762795} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out552762795|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In552762795, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In552762795, ~z$w_buff1_used~0=~z$w_buff1_used~0_In552762795, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In552762795} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:58:57,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} 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-18 12:58:57,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1042061240 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1042061240 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1042061240| 0)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1042061240| ~z$w_buff0_used~0_In-1042061240) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042061240, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1042061240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042061240, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1042061240|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1042061240} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:58:57,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In375182166 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In375182166 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In375182166 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In375182166 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out375182166| ~z$w_buff1_used~0_In375182166) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out375182166| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In375182166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In375182166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In375182166, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In375182166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In375182166, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In375182166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In375182166, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out375182166|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In375182166} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:58:57,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1683463564 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1683463564 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1683463564|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1683463564 |P1Thread1of1ForFork2_#t~ite13_Out-1683463564|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683463564, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1683463564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683463564, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1683463564|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1683463564} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:58:57,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In696939213 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In696939213 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In696939213 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In696939213 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out696939213|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In696939213 |P1Thread1of1ForFork2_#t~ite14_Out696939213|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In696939213, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In696939213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696939213, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In696939213} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In696939213, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In696939213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696939213, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out696939213|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In696939213} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:58:57,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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-18 12:58:57,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:58:57,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-77848962 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-77848962 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-77848962| ~z$w_buff1~0_In-77848962) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-77848962| ~z~0_In-77848962) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-77848962, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77848962, ~z$w_buff1~0=~z$w_buff1~0_In-77848962, ~z~0=~z~0_In-77848962} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-77848962, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-77848962|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77848962, ~z$w_buff1~0=~z$w_buff1~0_In-77848962, ~z~0=~z~0_In-77848962} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:58:57,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:58:57,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1215501611 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1215501611 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1215501611 |ULTIMATE.start_main_#t~ite49_Out-1215501611|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1215501611|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1215501611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215501611} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1215501611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1215501611, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1215501611|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:58:57,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1969000691 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1969000691 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1969000691 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1969000691 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1969000691| ~z$w_buff1_used~0_In-1969000691) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1969000691| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1969000691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1969000691, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1969000691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1969000691} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1969000691|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1969000691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1969000691, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1969000691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1969000691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:58:57,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1166226912 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1166226912 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1166226912 |ULTIMATE.start_main_#t~ite51_Out1166226912|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1166226912|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1166226912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1166226912} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1166226912, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1166226912|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1166226912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:58:57,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1555861798 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1555861798 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1555861798 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1555861798 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1555861798| ~z$r_buff1_thd0~0_In-1555861798) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out-1555861798| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1555861798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1555861798, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1555861798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1555861798} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1555861798|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1555861798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1555861798, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1555861798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1555861798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:58:57,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~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-18 12:58:57,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:58:57 BasicIcfg [2019-12-18 12:58:57,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:58:57,669 INFO L168 Benchmark]: Toolchain (without parser) took 157135.54 ms. Allocated memory was 137.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,669 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:58:57,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.12 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.62 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,671 INFO L168 Benchmark]: Boogie Preprocessor took 39.75 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,671 INFO L168 Benchmark]: RCFGBuilder took 960.44 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 98.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,672 INFO L168 Benchmark]: TraceAbstraction took 155305.33 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:58:57,673 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.25 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.12 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.62 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.75 ms. Allocated memory is still 201.3 MB. Free memory was 151.3 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 960.44 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 98.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155305.33 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t669, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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_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] [L827] FCALL, FORK 0 pthread_create(&t670, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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_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=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=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t671, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, x=1, y=2, z=0, z$flush_delayed=7, 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] [L790] 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_p2_EAX=2, __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=7, x=1, y=2, z=0, z$flush_delayed=7, 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] [L790] 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) [L766] 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) [L791] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, 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=2, z=0, z$flush_delayed=7, 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] [L791] 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)) [L792] 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)) [L793] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, 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))=1, x=1, y=2, z=0, z$flush_delayed=7, 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] [L793] 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)) [L796] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, 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=2, z=0, z$flush_delayed=7, 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] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, x=1, y=2, z=0, z$flush_delayed=7, 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] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, x=1, y=2, 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] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p2_EAX=2, __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=7, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.9s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 63.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13418 SDtfs, 17194 SDslu, 49224 SDs, 0 SdLazy, 33836 SolverSat, 746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 136 SyntacticMatches, 50 SemanticMatches, 615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3847 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 56.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 569917 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2363 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2251 ConstructedInterpolants, 0 QuantifiedInterpolants, 583979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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...