/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:41:07,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:41:07,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:41:07,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:41:07,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:41:07,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:41:07,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:41:07,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:41:07,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:41:07,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:41:07,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:41:07,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:41:07,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:41:07,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:41:07,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:41:07,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:41:07,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:41:07,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:41:07,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:41:07,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:41:07,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:41:07,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:41:07,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:41:07,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:41:07,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:41:07,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:41:07,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:41:07,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:41:07,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:41:07,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:41:07,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:41:07,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:41:07,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:41:07,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:41:07,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:41:07,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:41:07,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:41:07,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:41:07,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:41:07,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:41:07,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:41:07,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:41:07,405 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:41:07,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:41:07,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:41:07,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:41:07,409 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:41:07,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:41:07,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:41:07,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:41:07,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:41:07,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:41:07,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:41:07,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:41:07,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:41:07,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:41:07,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:41:07,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:41:07,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:41:07,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:41:07,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:41:07,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:41:07,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:41:07,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:41:07,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:41:07,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:41:07,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:41:07,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:41:07,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:41:07,415 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:41:07,416 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:41:07,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:41:07,416 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:41:07,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:41:07,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:41:07,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:41:07,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:41:07,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:41:07,743 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:41:07,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-27 20:41:07,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35a2771b/c9be2184414b4ce486b7e4f90fa90a12/FLAGee287b669 [2019-12-27 20:41:08,391 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:41:08,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-27 20:41:08,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35a2771b/c9be2184414b4ce486b7e4f90fa90a12/FLAGee287b669 [2019-12-27 20:41:08,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35a2771b/c9be2184414b4ce486b7e4f90fa90a12 [2019-12-27 20:41:08,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:41:08,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:41:08,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:41:08,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:41:08,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:41:08,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:08" (1/1) ... [2019-12-27 20:41:08,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5888c512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:08, skipping insertion in model container [2019-12-27 20:41:08,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:08" (1/1) ... [2019-12-27 20:41:08,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:41:08,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:41:09,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:41:09,357 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:41:09,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:41:09,503 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:41:09,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09 WrapperNode [2019-12-27 20:41:09,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:41:09,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:41:09,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:41:09,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:41:09,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:41:09,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:41:09,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:41:09,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:41:09,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... [2019-12-27 20:41:09,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:41:09,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:41:09,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:41:09,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:41:09,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:41:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:41:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:41:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:41:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:41:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:41:09,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:41:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:41:09,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:41:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:41:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:41:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 20:41:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 20:41:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:41:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:41:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:41:09,702 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:41:10,545 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:41:10,545 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:41:10,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:10 BoogieIcfgContainer [2019-12-27 20:41:10,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:41:10,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:41:10,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:41:10,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:41:10,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:41:08" (1/3) ... [2019-12-27 20:41:10,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e90a6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:10, skipping insertion in model container [2019-12-27 20:41:10,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:09" (2/3) ... [2019-12-27 20:41:10,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e90a6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:10, skipping insertion in model container [2019-12-27 20:41:10,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:10" (3/3) ... [2019-12-27 20:41:10,556 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-27 20:41:10,567 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:41:10,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:41:10,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:41:10,576 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:41:10,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,673 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,673 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,678 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,682 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,682 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,682 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,683 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,683 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,683 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,683 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,683 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,684 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,684 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,699 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,699 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,699 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:41:10,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 20:41:10,738 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:41:10,738 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:41:10,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:41:10,738 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:41:10,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:41:10,739 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:41:10,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:41:10,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:41:10,758 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 20:41:10,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 20:41:10,880 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 20:41:10,880 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:41:10,906 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:41:10,942 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 20:41:11,041 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 20:41:11,041 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:41:11,054 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:41:11,084 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 20:41:11,085 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:41:14,068 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-27 20:41:14,849 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:41:15,006 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:41:15,029 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78681 [2019-12-27 20:41:15,029 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 20:41:15,033 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 20:42:02,355 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 188550 states. [2019-12-27 20:42:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 188550 states. [2019-12-27 20:42:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:42:02,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:42:02,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:42:02,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:42:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:42:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1081112205, now seen corresponding path program 1 times [2019-12-27 20:42:02,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:42:02,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886686732] [2019-12-27 20:42:02,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:42:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:42:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:42:02,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886686732] [2019-12-27 20:42:02,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:42:02,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:42:02,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944203605] [2019-12-27 20:42:02,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:42:02,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:42:02,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:42:02,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:42:02,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:42:02,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:42:02,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:42:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:42:02,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:42:02,842 INFO L87 Difference]: Start difference. First operand 188550 states. Second operand 3 states. [2019-12-27 20:42:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:42:07,837 INFO L93 Difference]: Finished difference Result 175078 states and 839564 transitions. [2019-12-27 20:42:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:42:07,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:42:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:42:08,791 INFO L225 Difference]: With dead ends: 175078 [2019-12-27 20:42:08,791 INFO L226 Difference]: Without dead ends: 164262 [2019-12-27 20:42:08,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:42:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164262 states. [2019-12-27 20:42:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164262 to 164262. [2019-12-27 20:42:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164262 states. [2019-12-27 20:42:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164262 states to 164262 states and 786680 transitions. [2019-12-27 20:42:24,332 INFO L78 Accepts]: Start accepts. Automaton has 164262 states and 786680 transitions. Word has length 7 [2019-12-27 20:42:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:42:24,333 INFO L462 AbstractCegarLoop]: Abstraction has 164262 states and 786680 transitions. [2019-12-27 20:42:24,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:42:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 164262 states and 786680 transitions. [2019-12-27 20:42:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:42:24,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:42:24,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:42:24,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:42:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:42:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash -983624590, now seen corresponding path program 1 times [2019-12-27 20:42:24,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:42:24,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363470657] [2019-12-27 20:42:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:42:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:42:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:42:24,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363470657] [2019-12-27 20:42:24,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:42:24,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:42:24,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1593315729] [2019-12-27 20:42:24,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:42:24,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:42:24,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:42:24,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:42:24,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:42:24,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:42:24,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:42:24,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:42:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:42:24,464 INFO L87 Difference]: Start difference. First operand 164262 states and 786680 transitions. Second operand 4 states. [2019-12-27 20:42:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:42:32,440 INFO L93 Difference]: Finished difference Result 260206 states and 1199142 transitions. [2019-12-27 20:42:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:42:32,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 20:42:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:42:34,297 INFO L225 Difference]: With dead ends: 260206 [2019-12-27 20:42:34,298 INFO L226 Difference]: Without dead ends: 259982 [2019-12-27 20:42:34,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:42:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259982 states. [2019-12-27 20:42:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259982 to 241474. [2019-12-27 20:42:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241474 states. [2019-12-27 20:43:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241474 states to 241474 states and 1122210 transitions. [2019-12-27 20:43:03,272 INFO L78 Accepts]: Start accepts. Automaton has 241474 states and 1122210 transitions. Word has length 15 [2019-12-27 20:43:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:03,272 INFO L462 AbstractCegarLoop]: Abstraction has 241474 states and 1122210 transitions. [2019-12-27 20:43:03,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:43:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 241474 states and 1122210 transitions. [2019-12-27 20:43:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:43:03,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:03,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:03,278 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1733643067, now seen corresponding path program 1 times [2019-12-27 20:43:03,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:03,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179965953] [2019-12-27 20:43:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:03,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179965953] [2019-12-27 20:43:03,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:03,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:43:03,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821590273] [2019-12-27 20:43:03,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:03,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:03,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:43:03,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:03,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:43:03,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:43:03,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:43:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:43:03,334 INFO L87 Difference]: Start difference. First operand 241474 states and 1122210 transitions. Second operand 3 states. [2019-12-27 20:43:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:04,115 INFO L93 Difference]: Finished difference Result 150344 states and 629507 transitions. [2019-12-27 20:43:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:04,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 20:43:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:06,591 INFO L225 Difference]: With dead ends: 150344 [2019-12-27 20:43:06,592 INFO L226 Difference]: Without dead ends: 150344 [2019-12-27 20:43:06,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:43:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150344 states. [2019-12-27 20:43:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150344 to 150344. [2019-12-27 20:43:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150344 states. [2019-12-27 20:43:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150344 states to 150344 states and 629507 transitions. [2019-12-27 20:43:22,810 INFO L78 Accepts]: Start accepts. Automaton has 150344 states and 629507 transitions. Word has length 15 [2019-12-27 20:43:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:22,811 INFO L462 AbstractCegarLoop]: Abstraction has 150344 states and 629507 transitions. [2019-12-27 20:43:22,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:43:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 150344 states and 629507 transitions. [2019-12-27 20:43:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:43:22,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:22,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:22,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 763013226, now seen corresponding path program 1 times [2019-12-27 20:43:22,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:22,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280376093] [2019-12-27 20:43:22,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:22,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280376093] [2019-12-27 20:43:22,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:22,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:22,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084976537] [2019-12-27 20:43:22,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:22,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:22,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 20:43:22,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:22,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:22,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:43:22,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:22,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:43:22,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:43:22,945 INFO L87 Difference]: Start difference. First operand 150344 states and 629507 transitions. Second operand 5 states. [2019-12-27 20:43:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:23,180 INFO L93 Difference]: Finished difference Result 41318 states and 147207 transitions. [2019-12-27 20:43:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:43:23,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:43:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:23,258 INFO L225 Difference]: With dead ends: 41318 [2019-12-27 20:43:23,259 INFO L226 Difference]: Without dead ends: 41318 [2019-12-27 20:43:23,259 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-27 20:43:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41318 states. [2019-12-27 20:43:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41318 to 41318. [2019-12-27 20:43:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41318 states. [2019-12-27 20:43:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41318 states to 41318 states and 147207 transitions. [2019-12-27 20:43:24,977 INFO L78 Accepts]: Start accepts. Automaton has 41318 states and 147207 transitions. Word has length 16 [2019-12-27 20:43:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:24,978 INFO L462 AbstractCegarLoop]: Abstraction has 41318 states and 147207 transitions. [2019-12-27 20:43:24,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:43:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 41318 states and 147207 transitions. [2019-12-27 20:43:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:43:24,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:24,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:24,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash -613707051, now seen corresponding path program 1 times [2019-12-27 20:43:24,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:24,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061129353] [2019-12-27 20:43:24,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:25,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061129353] [2019-12-27 20:43:25,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:25,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:25,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940285090] [2019-12-27 20:43:25,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:25,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:25,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:43:25,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:25,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:43:25,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:43:25,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:43:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:43:25,180 INFO L87 Difference]: Start difference. First operand 41318 states and 147207 transitions. Second operand 7 states. [2019-12-27 20:43:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:26,094 INFO L93 Difference]: Finished difference Result 59208 states and 207429 transitions. [2019-12-27 20:43:26,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:43:26,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 20:43:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:26,251 INFO L225 Difference]: With dead ends: 59208 [2019-12-27 20:43:26,251 INFO L226 Difference]: Without dead ends: 59190 [2019-12-27 20:43:26,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:43:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59190 states. [2019-12-27 20:43:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59190 to 47448. [2019-12-27 20:43:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47448 states. [2019-12-27 20:43:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47448 states to 47448 states and 168412 transitions. [2019-12-27 20:43:29,998 INFO L78 Accepts]: Start accepts. Automaton has 47448 states and 168412 transitions. Word has length 16 [2019-12-27 20:43:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:29,999 INFO L462 AbstractCegarLoop]: Abstraction has 47448 states and 168412 transitions. [2019-12-27 20:43:29,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:43:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47448 states and 168412 transitions. [2019-12-27 20:43:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:43:30,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:30,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:30,019 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:30,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -671023088, now seen corresponding path program 1 times [2019-12-27 20:43:30,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:30,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181450126] [2019-12-27 20:43:30,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:30,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181450126] [2019-12-27 20:43:30,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:30,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:43:30,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1490932464] [2019-12-27 20:43:30,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:30,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:30,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 100 transitions. [2019-12-27 20:43:30,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:30,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:30,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:43:30,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:43:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:43:30,289 INFO L87 Difference]: Start difference. First operand 47448 states and 168412 transitions. Second operand 8 states. [2019-12-27 20:43:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:32,841 INFO L93 Difference]: Finished difference Result 144690 states and 501529 transitions. [2019-12-27 20:43:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:43:32,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 20:43:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:33,173 INFO L225 Difference]: With dead ends: 144690 [2019-12-27 20:43:33,173 INFO L226 Difference]: Without dead ends: 144637 [2019-12-27 20:43:33,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:43:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144637 states. [2019-12-27 20:43:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144637 to 70302. [2019-12-27 20:43:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70302 states. [2019-12-27 20:43:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70302 states to 70302 states and 249360 transitions. [2019-12-27 20:43:35,583 INFO L78 Accepts]: Start accepts. Automaton has 70302 states and 249360 transitions. Word has length 24 [2019-12-27 20:43:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:35,584 INFO L462 AbstractCegarLoop]: Abstraction has 70302 states and 249360 transitions. [2019-12-27 20:43:35,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:43:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 70302 states and 249360 transitions. [2019-12-27 20:43:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:43:35,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:35,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:43:35,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1655550286, now seen corresponding path program 2 times [2019-12-27 20:43:35,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:35,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569039177] [2019-12-27 20:43:35,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:35,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569039177] [2019-12-27 20:43:35,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:35,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:35,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995377802] [2019-12-27 20:43:35,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:35,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:35,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 40 transitions. [2019-12-27 20:43:35,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:43:35,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:43:35,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:43:35,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:43:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:43:35,884 INFO L87 Difference]: Start difference. First operand 70302 states and 249360 transitions. Second operand 10 states. [2019-12-27 20:43:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:38,992 INFO L93 Difference]: Finished difference Result 127573 states and 440756 transitions. [2019-12-27 20:43:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:43:38,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 20:43:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:39,268 INFO L225 Difference]: With dead ends: 127573 [2019-12-27 20:43:39,268 INFO L226 Difference]: Without dead ends: 127539 [2019-12-27 20:43:39,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:43:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127539 states. [2019-12-27 20:43:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127539 to 68426. [2019-12-27 20:43:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68426 states. [2019-12-27 20:43:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68426 states to 68426 states and 243998 transitions. [2019-12-27 20:43:41,717 INFO L78 Accepts]: Start accepts. Automaton has 68426 states and 243998 transitions. Word has length 24 [2019-12-27 20:43:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:41,718 INFO L462 AbstractCegarLoop]: Abstraction has 68426 states and 243998 transitions. [2019-12-27 20:43:41,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:43:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 68426 states and 243998 transitions. [2019-12-27 20:43:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:43:41,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:41,760 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-27 20:43:41,761 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -477366327, now seen corresponding path program 1 times [2019-12-27 20:43:41,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:41,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382897474] [2019-12-27 20:43:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:41,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382897474] [2019-12-27 20:43:41,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:41,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:43:41,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919011577] [2019-12-27 20:43:41,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:41,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:41,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 20:43:41,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:41,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:41,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:43:41,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:43:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:43:41,842 INFO L87 Difference]: Start difference. First operand 68426 states and 243998 transitions. Second operand 6 states. [2019-12-27 20:43:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:42,078 INFO L93 Difference]: Finished difference Result 39073 states and 141657 transitions. [2019-12-27 20:43:42,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:43:42,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:43:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:42,155 INFO L225 Difference]: With dead ends: 39073 [2019-12-27 20:43:42,156 INFO L226 Difference]: Without dead ends: 39073 [2019-12-27 20:43:42,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:43:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39073 states. [2019-12-27 20:43:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39073 to 37795. [2019-12-27 20:43:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37795 states. [2019-12-27 20:43:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37795 states to 37795 states and 137104 transitions. [2019-12-27 20:43:43,504 INFO L78 Accepts]: Start accepts. Automaton has 37795 states and 137104 transitions. Word has length 28 [2019-12-27 20:43:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:43,505 INFO L462 AbstractCegarLoop]: Abstraction has 37795 states and 137104 transitions. [2019-12-27 20:43:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:43:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 37795 states and 137104 transitions. [2019-12-27 20:43:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:43:43,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:43,568 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] [2019-12-27 20:43:43,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash -574356162, now seen corresponding path program 1 times [2019-12-27 20:43:43,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:43,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720119745] [2019-12-27 20:43:43,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:43,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720119745] [2019-12-27 20:43:43,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:43,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:43:43,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112044353] [2019-12-27 20:43:43,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:43,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:43,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 160 transitions. [2019-12-27 20:43:43,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:43,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:43,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:43:43,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:43,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:43:43,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:43,704 INFO L87 Difference]: Start difference. First operand 37795 states and 137104 transitions. Second operand 4 states. [2019-12-27 20:43:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:43,915 INFO L93 Difference]: Finished difference Result 56982 states and 197218 transitions. [2019-12-27 20:43:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:43,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 20:43:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:43,985 INFO L225 Difference]: With dead ends: 56982 [2019-12-27 20:43:43,985 INFO L226 Difference]: Without dead ends: 38430 [2019-12-27 20:43:43,986 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-27 20:43:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38430 states. [2019-12-27 20:43:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38430 to 37152. [2019-12-27 20:43:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37152 states. [2019-12-27 20:43:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37152 states to 37152 states and 117700 transitions. [2019-12-27 20:43:44,587 INFO L78 Accepts]: Start accepts. Automaton has 37152 states and 117700 transitions. Word has length 42 [2019-12-27 20:43:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:44,588 INFO L462 AbstractCegarLoop]: Abstraction has 37152 states and 117700 transitions. [2019-12-27 20:43:44,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:43:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37152 states and 117700 transitions. [2019-12-27 20:43:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 20:43:44,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:44,810 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] [2019-12-27 20:43:44,810 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -842084234, now seen corresponding path program 1 times [2019-12-27 20:43:44,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:44,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33047769] [2019-12-27 20:43:44,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:44,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33047769] [2019-12-27 20:43:44,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:44,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:44,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [419579667] [2019-12-27 20:43:44,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:44,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:45,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 261 transitions. [2019-12-27 20:43:45,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:45,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:45,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:43:45,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:45,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:43:45,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:43:45,035 INFO L87 Difference]: Start difference. First operand 37152 states and 117700 transitions. Second operand 8 states. [2019-12-27 20:43:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:45,275 INFO L93 Difference]: Finished difference Result 35635 states and 113790 transitions. [2019-12-27 20:43:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:43:45,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 20:43:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:45,308 INFO L225 Difference]: With dead ends: 35635 [2019-12-27 20:43:45,308 INFO L226 Difference]: Without dead ends: 18523 [2019-12-27 20:43:45,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:43:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18523 states. [2019-12-27 20:43:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18523 to 17391. [2019-12-27 20:43:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17391 states. [2019-12-27 20:43:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17391 states to 17391 states and 55406 transitions. [2019-12-27 20:43:45,590 INFO L78 Accepts]: Start accepts. Automaton has 17391 states and 55406 transitions. Word has length 43 [2019-12-27 20:43:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:45,590 INFO L462 AbstractCegarLoop]: Abstraction has 17391 states and 55406 transitions. [2019-12-27 20:43:45,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:43:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17391 states and 55406 transitions. [2019-12-27 20:43:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:45,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:45,617 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] [2019-12-27 20:43:45,617 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 26533346, now seen corresponding path program 1 times [2019-12-27 20:43:45,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:45,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493364056] [2019-12-27 20:43:45,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:45,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493364056] [2019-12-27 20:43:45,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:45,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:45,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701619610] [2019-12-27 20:43:45,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:45,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:45,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 405 transitions. [2019-12-27 20:43:45,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:45,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:45,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:43:45,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:43:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:43:45,912 INFO L87 Difference]: Start difference. First operand 17391 states and 55406 transitions. Second operand 4 states. [2019-12-27 20:43:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:46,025 INFO L93 Difference]: Finished difference Result 21741 states and 67992 transitions. [2019-12-27 20:43:46,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:43:46,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 20:43:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:46,054 INFO L225 Difference]: With dead ends: 21741 [2019-12-27 20:43:46,055 INFO L226 Difference]: Without dead ends: 21741 [2019-12-27 20:43:46,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-27 20:43:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21741 states. [2019-12-27 20:43:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21741 to 14603. [2019-12-27 20:43:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14603 states. [2019-12-27 20:43:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14603 states to 14603 states and 45746 transitions. [2019-12-27 20:43:46,446 INFO L78 Accepts]: Start accepts. Automaton has 14603 states and 45746 transitions. Word has length 57 [2019-12-27 20:43:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:46,446 INFO L462 AbstractCegarLoop]: Abstraction has 14603 states and 45746 transitions. [2019-12-27 20:43:46,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:43:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 45746 transitions. [2019-12-27 20:43:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:46,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:46,467 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] [2019-12-27 20:43:46,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1203985163, now seen corresponding path program 1 times [2019-12-27 20:43:46,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:46,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896542252] [2019-12-27 20:43:46,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:46,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896542252] [2019-12-27 20:43:46,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:46,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:43:46,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206565309] [2019-12-27 20:43:46,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:46,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:46,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 405 transitions. [2019-12-27 20:43:46,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:46,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:43:46,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:43:46,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:43:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:43:46,871 INFO L87 Difference]: Start difference. First operand 14603 states and 45746 transitions. Second operand 5 states. [2019-12-27 20:43:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:47,011 INFO L93 Difference]: Finished difference Result 26589 states and 83289 transitions. [2019-12-27 20:43:47,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:43:47,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:43:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:47,037 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 20:43:47,038 INFO L226 Difference]: Without dead ends: 12334 [2019-12-27 20:43:47,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:43:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12334 states. [2019-12-27 20:43:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12334 to 12334. [2019-12-27 20:43:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12334 states. [2019-12-27 20:43:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12334 states to 12334 states and 38509 transitions. [2019-12-27 20:43:47,313 INFO L78 Accepts]: Start accepts. Automaton has 12334 states and 38509 transitions. Word has length 57 [2019-12-27 20:43:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:47,314 INFO L462 AbstractCegarLoop]: Abstraction has 12334 states and 38509 transitions. [2019-12-27 20:43:47,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:43:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 12334 states and 38509 transitions. [2019-12-27 20:43:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:47,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:47,328 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] [2019-12-27 20:43:47,328 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash -639237961, now seen corresponding path program 2 times [2019-12-27 20:43:47,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:47,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383547941] [2019-12-27 20:43:47,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:47,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383547941] [2019-12-27 20:43:47,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:47,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:43:47,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035518212] [2019-12-27 20:43:47,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:47,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:47,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 377 states and 661 transitions. [2019-12-27 20:43:47,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:47,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:43:47,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:43:47,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:43:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:43:47,915 INFO L87 Difference]: Start difference. First operand 12334 states and 38509 transitions. Second operand 7 states. [2019-12-27 20:43:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:48,329 INFO L93 Difference]: Finished difference Result 37088 states and 113727 transitions. [2019-12-27 20:43:48,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:43:48,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 20:43:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:48,370 INFO L225 Difference]: With dead ends: 37088 [2019-12-27 20:43:48,370 INFO L226 Difference]: Without dead ends: 27206 [2019-12-27 20:43:48,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-27 20:43:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27206 states. [2019-12-27 20:43:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27206 to 15725. [2019-12-27 20:43:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-12-27 20:43:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 49042 transitions. [2019-12-27 20:43:48,736 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 49042 transitions. Word has length 57 [2019-12-27 20:43:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:48,736 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 49042 transitions. [2019-12-27 20:43:48,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:43:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 49042 transitions. [2019-12-27 20:43:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:48,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:48,754 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] [2019-12-27 20:43:48,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1810961603, now seen corresponding path program 3 times [2019-12-27 20:43:48,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:48,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671758713] [2019-12-27 20:43:48,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:43:48,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671758713] [2019-12-27 20:43:48,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:48,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:43:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448814715] [2019-12-27 20:43:48,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:48,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:49,564 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 365 states and 712 transitions. [2019-12-27 20:43:49,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:49,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:43:49,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:43:49,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:43:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:43:49,954 INFO L87 Difference]: Start difference. First operand 15725 states and 49042 transitions. Second operand 13 states. [2019-12-27 20:43:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:43:57,323 INFO L93 Difference]: Finished difference Result 120150 states and 370120 transitions. [2019-12-27 20:43:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-27 20:43:57,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 20:43:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:43:57,462 INFO L225 Difference]: With dead ends: 120150 [2019-12-27 20:43:57,462 INFO L226 Difference]: Without dead ends: 89320 [2019-12-27 20:43:57,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1056, Invalid=4200, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 20:43:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89320 states. [2019-12-27 20:43:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89320 to 25541. [2019-12-27 20:43:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25541 states. [2019-12-27 20:43:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25541 states to 25541 states and 80299 transitions. [2019-12-27 20:43:58,405 INFO L78 Accepts]: Start accepts. Automaton has 25541 states and 80299 transitions. Word has length 57 [2019-12-27 20:43:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:43:58,405 INFO L462 AbstractCegarLoop]: Abstraction has 25541 states and 80299 transitions. [2019-12-27 20:43:58,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:43:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25541 states and 80299 transitions. [2019-12-27 20:43:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:43:58,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:43:58,434 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] [2019-12-27 20:43:58,434 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:43:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:43:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -906088077, now seen corresponding path program 4 times [2019-12-27 20:43:58,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:43:58,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334570144] [2019-12-27 20:43:58,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:43:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:43:58,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-27 20:43:58,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334570144] [2019-12-27 20:43:58,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:43:58,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:43:58,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736536491] [2019-12-27 20:43:58,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:43:58,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:43:58,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 20:43:58,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:43:59,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:43:59,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:43:59,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:43:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:43:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:43:59,117 INFO L87 Difference]: Start difference. First operand 25541 states and 80299 transitions. Second operand 11 states. [2019-12-27 20:44:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:01,555 INFO L93 Difference]: Finished difference Result 94517 states and 287140 transitions. [2019-12-27 20:44:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:44:01,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 20:44:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:01,692 INFO L225 Difference]: With dead ends: 94517 [2019-12-27 20:44:01,692 INFO L226 Difference]: Without dead ends: 86359 [2019-12-27 20:44:01,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:44:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86359 states. [2019-12-27 20:44:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86359 to 25591. [2019-12-27 20:44:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25591 states. [2019-12-27 20:44:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25591 states to 25591 states and 80494 transitions. [2019-12-27 20:44:02,880 INFO L78 Accepts]: Start accepts. Automaton has 25591 states and 80494 transitions. Word has length 57 [2019-12-27 20:44:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:02,881 INFO L462 AbstractCegarLoop]: Abstraction has 25591 states and 80494 transitions. [2019-12-27 20:44:02,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:44:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25591 states and 80494 transitions. [2019-12-27 20:44:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:02,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:02,911 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] [2019-12-27 20:44:02,911 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1870208530, now seen corresponding path program 1 times [2019-12-27 20:44:02,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:02,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588808304] [2019-12-27 20:44:02,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:02,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588808304] [2019-12-27 20:44:02,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:02,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:44:02,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82063769] [2019-12-27 20:44:02,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:02,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:03,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 20:44:03,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:03,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:44:03,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:44:03,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:44:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:44:03,201 INFO L87 Difference]: Start difference. First operand 25591 states and 80494 transitions. Second operand 3 states. [2019-12-27 20:44:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:03,320 INFO L93 Difference]: Finished difference Result 27177 states and 83159 transitions. [2019-12-27 20:44:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:44:03,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:44:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:03,359 INFO L225 Difference]: With dead ends: 27177 [2019-12-27 20:44:03,359 INFO L226 Difference]: Without dead ends: 27177 [2019-12-27 20:44:03,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-27 20:44:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27177 states. [2019-12-27 20:44:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27177 to 20753. [2019-12-27 20:44:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20753 states. [2019-12-27 20:44:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20753 states to 20753 states and 63893 transitions. [2019-12-27 20:44:03,738 INFO L78 Accepts]: Start accepts. Automaton has 20753 states and 63893 transitions. Word has length 57 [2019-12-27 20:44:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:03,738 INFO L462 AbstractCegarLoop]: Abstraction has 20753 states and 63893 transitions. [2019-12-27 20:44:03,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:44:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20753 states and 63893 transitions. [2019-12-27 20:44:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:03,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:03,763 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] [2019-12-27 20:44:03,763 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1888273665, now seen corresponding path program 5 times [2019-12-27 20:44:03,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:03,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708924525] [2019-12-27 20:44:03,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:03,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708924525] [2019-12-27 20:44:03,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:03,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:44:03,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989671561] [2019-12-27 20:44:03,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:03,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:04,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 321 states and 609 transitions. [2019-12-27 20:44:04,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:04,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:44:04,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:44:04,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:44:04,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:44:04,363 INFO L87 Difference]: Start difference. First operand 20753 states and 63893 transitions. Second operand 9 states. [2019-12-27 20:44:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:05,952 INFO L93 Difference]: Finished difference Result 49733 states and 149665 transitions. [2019-12-27 20:44:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:44:05,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 20:44:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:06,015 INFO L225 Difference]: With dead ends: 49733 [2019-12-27 20:44:06,016 INFO L226 Difference]: Without dead ends: 42991 [2019-12-27 20:44:06,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:44:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42991 states. [2019-12-27 20:44:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42991 to 20969. [2019-12-27 20:44:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 20:44:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 64530 transitions. [2019-12-27 20:44:06,527 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 64530 transitions. Word has length 57 [2019-12-27 20:44:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:06,527 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 64530 transitions. [2019-12-27 20:44:06,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:44:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 64530 transitions. [2019-12-27 20:44:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:06,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:06,552 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] [2019-12-27 20:44:06,552 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 546690713, now seen corresponding path program 6 times [2019-12-27 20:44:06,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:06,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698512265] [2019-12-27 20:44:06,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:06,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698512265] [2019-12-27 20:44:06,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:06,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:44:06,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96233654] [2019-12-27 20:44:06,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:06,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:07,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 433 states and 781 transitions. [2019-12-27 20:44:07,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:07,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:44:07,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:44:07,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:44:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:44:07,416 INFO L87 Difference]: Start difference. First operand 20969 states and 64530 transitions. Second operand 14 states. [2019-12-27 20:44:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:13,762 INFO L93 Difference]: Finished difference Result 69458 states and 205614 transitions. [2019-12-27 20:44:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 20:44:13,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 20:44:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:13,860 INFO L225 Difference]: With dead ends: 69458 [2019-12-27 20:44:13,860 INFO L226 Difference]: Without dead ends: 69458 [2019-12-27 20:44:13,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=611, Invalid=3421, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 20:44:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69458 states. [2019-12-27 20:44:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69458 to 25660. [2019-12-27 20:44:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25660 states. [2019-12-27 20:44:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25660 states to 25660 states and 78132 transitions. [2019-12-27 20:44:14,683 INFO L78 Accepts]: Start accepts. Automaton has 25660 states and 78132 transitions. Word has length 57 [2019-12-27 20:44:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:14,683 INFO L462 AbstractCegarLoop]: Abstraction has 25660 states and 78132 transitions. [2019-12-27 20:44:14,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:44:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25660 states and 78132 transitions. [2019-12-27 20:44:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:14,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:14,715 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] [2019-12-27 20:44:14,715 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1736803737, now seen corresponding path program 7 times [2019-12-27 20:44:14,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:14,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631504269] [2019-12-27 20:44:14,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:14,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631504269] [2019-12-27 20:44:14,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:14,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:44:14,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615899603] [2019-12-27 20:44:14,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:14,900 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:15,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 343 states and 570 transitions. [2019-12-27 20:44:15,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:16,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:44:16,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:44:16,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:44:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:44:16,354 INFO L87 Difference]: Start difference. First operand 25660 states and 78132 transitions. Second operand 20 states. [2019-12-27 20:44:17,650 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-27 20:44:26,511 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 20:44:26,669 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 20:44:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:44:29,340 INFO L93 Difference]: Finished difference Result 78481 states and 229451 transitions. [2019-12-27 20:44:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-27 20:44:29,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-27 20:44:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:44:29,457 INFO L225 Difference]: With dead ends: 78481 [2019-12-27 20:44:29,457 INFO L226 Difference]: Without dead ends: 78088 [2019-12-27 20:44:29,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4474 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2275, Invalid=10381, Unknown=0, NotChecked=0, Total=12656 [2019-12-27 20:44:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78088 states. [2019-12-27 20:44:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78088 to 28856. [2019-12-27 20:44:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28856 states. [2019-12-27 20:44:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28856 states to 28856 states and 86396 transitions. [2019-12-27 20:44:30,404 INFO L78 Accepts]: Start accepts. Automaton has 28856 states and 86396 transitions. Word has length 57 [2019-12-27 20:44:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:44:30,404 INFO L462 AbstractCegarLoop]: Abstraction has 28856 states and 86396 transitions. [2019-12-27 20:44:30,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:44:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28856 states and 86396 transitions. [2019-12-27 20:44:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:44:30,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:44:30,582 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] [2019-12-27 20:44:30,582 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:44:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:44:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash -858054405, now seen corresponding path program 8 times [2019-12-27 20:44:30,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:44:30,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761791259] [2019-12-27 20:44:30,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:44:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:44:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:44:30,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761791259] [2019-12-27 20:44:30,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:44:30,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:44:30,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1508649469] [2019-12-27 20:44:30,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:44:30,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:44:31,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 386 states and 665 transitions. [2019-12-27 20:44:31,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:44:31,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:44:31,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:44:31,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:44:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:44:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:44:31,446 INFO L87 Difference]: Start difference. First operand 28856 states and 86396 transitions. Second operand 17 states. [2019-12-27 20:44:36,768 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 Received shutdown request... [2019-12-27 20:44:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-27 20:44:39,158 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 20:44:39,163 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 20:44:39,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:44:39 BasicIcfg [2019-12-27 20:44:39,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:44:39,165 INFO L168 Benchmark]: Toolchain (without parser) took 210505.70 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,166 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 154.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.76 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,167 INFO L168 Benchmark]: Boogie Preprocessor took 37.67 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,168 INFO L168 Benchmark]: RCFGBuilder took 925.51 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 100.1 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,169 INFO L168 Benchmark]: TraceAbstraction took 208615.17 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:44:39,172 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.64 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 154.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.76 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.67 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.51 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 100.1 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208615.17 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7362 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 78681 CheckedPairsTotal, 120 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (28856states) and FLOYD_HOARE automaton (currently 87 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (60119 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (28856states) and FLOYD_HOARE automaton (currently 87 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (60119 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 208.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 67.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5229 SDtfs, 11837 SDslu, 18452 SDs, 0 SdLazy, 21757 SolverSat, 1282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 165 SyntacticMatches, 37 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10415 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241474occurred 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: 79.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 432028 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 152314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown