/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:55:52,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:55:52,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:55:52,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:55:52,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:55:52,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:55:52,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:55:52,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:55:52,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:55:52,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:55:52,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:55:52,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:55:52,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:55:52,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:55:52,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:55:52,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:55:52,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:55:52,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:55:52,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:55:52,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:55:52,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:55:52,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:55:52,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:55:52,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:55:52,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:55:52,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:55:52,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:55:52,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:55:52,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:55:52,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:55:52,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:55:52,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:55:52,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:55:52,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:55:52,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:55:52,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:55:52,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:55:52,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:55:52,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:55:52,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:55:52,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:55:52,554 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-NoLbe-MCR.epf [2019-12-28 01:55:52,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:55:52,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:55:52,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:55:52,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:55:52,569 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:55:52,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:55:52,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:55:52,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:55:52,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:55:52,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:55:52,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:55:52,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:55:52,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:55:52,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:55:52,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:55:52,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:55:52,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:55:52,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:55:52,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:55:52,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:55:52,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:55:52,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:55:52,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:55:52,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:55:52,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:55:52,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:55:52,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:55:52,573 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:55:52,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:55:52,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:55:52,574 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:55:52,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:55:52,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:55:52,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:55:52,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:55:52,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:55:52,879 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:55:52,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-28 01:55:52,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb61319c/0ce0e435e9d54b64b8655fa0e2b3f918/FLAG99839cb0f [2019-12-28 01:55:53,527 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:55:53,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-28 01:55:53,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb61319c/0ce0e435e9d54b64b8655fa0e2b3f918/FLAG99839cb0f [2019-12-28 01:55:53,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb61319c/0ce0e435e9d54b64b8655fa0e2b3f918 [2019-12-28 01:55:53,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:55:53,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:55:53,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:53,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:55:53,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:55:53,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:53" (1/1) ... [2019-12-28 01:55:53,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327fbd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:53, skipping insertion in model container [2019-12-28 01:55:53,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:53" (1/1) ... [2019-12-28 01:55:53,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:55:53,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:55:54,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:54,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:55:54,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:54,574 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:55:54,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54 WrapperNode [2019-12-28 01:55:54,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:54,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:54,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:55:54,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:55:54,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:54,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:55:54,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:55:54,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:55:54,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (1/1) ... [2019-12-28 01:55:54,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:55:54,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:55:54,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:55:54,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:55:54,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (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-28 01:55:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:55:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:55:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:55:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:55:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:55:54,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:55:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:55:54,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:55:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 01:55:54,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 01:55:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:55:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:55:54,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:55:54,769 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 01:55:55,485 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:55:55,486 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:55:55,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:55 BoogieIcfgContainer [2019-12-28 01:55:55,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:55:55,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:55:55,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:55:55,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:55:55,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:55:53" (1/3) ... [2019-12-28 01:55:55,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeb4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:55, skipping insertion in model container [2019-12-28 01:55:55,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:54" (2/3) ... [2019-12-28 01:55:55,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeb4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:55, skipping insertion in model container [2019-12-28 01:55:55,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:55" (3/3) ... [2019-12-28 01:55:55,501 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-12-28 01:55:55,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:55:55,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:55:55,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:55:55,529 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:55:55,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,598 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,598 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,630 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,673 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:55,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 01:55:55,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:55:55,722 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:55:55,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:55:55,722 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:55:55,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:55:55,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:55:55,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:55:55,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:55:55,736 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 181 transitions [2019-12-28 01:56:13,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111191 states. [2019-12-28 01:56:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 111191 states. [2019-12-28 01:56:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:56:13,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:13,605 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] [2019-12-28 01:56:13,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1481943775, now seen corresponding path program 1 times [2019-12-28 01:56:13,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:13,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416017671] [2019-12-28 01:56:13,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:13,898 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-28 01:56:13,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416017671] [2019-12-28 01:56:13,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:13,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:56:13,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28864846] [2019-12-28 01:56:13,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:13,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:13,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:56:13,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:13,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:13,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:56:13,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:56:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:13,966 INFO L87 Difference]: Start difference. First operand 111191 states. Second operand 4 states. [2019-12-28 01:56:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:17,935 INFO L93 Difference]: Finished difference Result 114119 states and 522355 transitions. [2019-12-28 01:56:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:56:17,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-28 01:56:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:18,691 INFO L225 Difference]: With dead ends: 114119 [2019-12-28 01:56:18,691 INFO L226 Difference]: Without dead ends: 82839 [2019-12-28 01:56:18,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82839 states. [2019-12-28 01:56:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82839 to 82839. [2019-12-28 01:56:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82839 states. [2019-12-28 01:56:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82839 states to 82839 states and 380415 transitions. [2019-12-28 01:56:25,367 INFO L78 Accepts]: Start accepts. Automaton has 82839 states and 380415 transitions. Word has length 50 [2019-12-28 01:56:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:25,368 INFO L462 AbstractCegarLoop]: Abstraction has 82839 states and 380415 transitions. [2019-12-28 01:56:25,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:56:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82839 states and 380415 transitions. [2019-12-28 01:56:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:56:25,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:25,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:25,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1380811791, now seen corresponding path program 1 times [2019-12-28 01:56:25,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:25,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894060248] [2019-12-28 01:56:25,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:25,543 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-28 01:56:25,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894060248] [2019-12-28 01:56:25,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:25,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:25,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771770425] [2019-12-28 01:56:25,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:25,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:25,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:56:25,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:25,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:25,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:25,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:25,566 INFO L87 Difference]: Start difference. First operand 82839 states and 380415 transitions. Second operand 5 states. [2019-12-28 01:56:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:30,430 INFO L93 Difference]: Finished difference Result 129239 states and 566707 transitions. [2019-12-28 01:56:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:30,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-28 01:56:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:31,161 INFO L225 Difference]: With dead ends: 129239 [2019-12-28 01:56:31,162 INFO L226 Difference]: Without dead ends: 126479 [2019-12-28 01:56:31,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126479 states. [2019-12-28 01:56:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126479 to 119963. [2019-12-28 01:56:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119963 states. [2019-12-28 01:56:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119963 states to 119963 states and 531554 transitions. [2019-12-28 01:56:35,068 INFO L78 Accepts]: Start accepts. Automaton has 119963 states and 531554 transitions. Word has length 58 [2019-12-28 01:56:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:35,068 INFO L462 AbstractCegarLoop]: Abstraction has 119963 states and 531554 transitions. [2019-12-28 01:56:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 119963 states and 531554 transitions. [2019-12-28 01:56:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-28 01:56:35,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:35,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:35,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash -447711961, now seen corresponding path program 1 times [2019-12-28 01:56:35,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:35,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118611520] [2019-12-28 01:56:35,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:56:35,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118611520] [2019-12-28 01:56:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:35,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093127895] [2019-12-28 01:56:35,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:35,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:35,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 131 transitions. [2019-12-28 01:56:35,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:35,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:35,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:35,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:35,254 INFO L87 Difference]: Start difference. First operand 119963 states and 531554 transitions. Second operand 5 states. [2019-12-28 01:56:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:40,614 INFO L93 Difference]: Finished difference Result 156375 states and 680703 transitions. [2019-12-28 01:56:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:40,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-28 01:56:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:41,171 INFO L225 Difference]: With dead ends: 156375 [2019-12-28 01:56:41,171 INFO L226 Difference]: Without dead ends: 154135 [2019-12-28 01:56:41,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154135 states. [2019-12-28 01:56:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154135 to 132947. [2019-12-28 01:56:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132947 states. [2019-12-28 01:56:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132947 states to 132947 states and 585328 transitions. [2019-12-28 01:56:46,104 INFO L78 Accepts]: Start accepts. Automaton has 132947 states and 585328 transitions. Word has length 59 [2019-12-28 01:56:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:46,105 INFO L462 AbstractCegarLoop]: Abstraction has 132947 states and 585328 transitions. [2019-12-28 01:56:46,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 132947 states and 585328 transitions. [2019-12-28 01:56:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 01:56:46,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:46,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:46,128 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash -429000659, now seen corresponding path program 1 times [2019-12-28 01:56:46,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:46,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126473474] [2019-12-28 01:56:46,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:46,200 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-28 01:56:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126473474] [2019-12-28 01:56:46,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:46,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:56:46,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006660685] [2019-12-28 01:56:46,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:46,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:46,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 149 transitions. [2019-12-28 01:56:46,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:46,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:56:46,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:56:46,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:56:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:46,313 INFO L87 Difference]: Start difference. First operand 132947 states and 585328 transitions. Second operand 4 states. [2019-12-28 01:56:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:52,137 INFO L93 Difference]: Finished difference Result 171279 states and 741345 transitions. [2019-12-28 01:56:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:56:52,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 01:56:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:52,887 INFO L225 Difference]: With dead ends: 171279 [2019-12-28 01:56:52,887 INFO L226 Difference]: Without dead ends: 171279 [2019-12-28 01:56:52,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171279 states. [2019-12-28 01:56:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171279 to 152003. [2019-12-28 01:56:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152003 states. [2019-12-28 01:57:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152003 states to 152003 states and 663356 transitions. [2019-12-28 01:57:06,789 INFO L78 Accepts]: Start accepts. Automaton has 152003 states and 663356 transitions. Word has length 61 [2019-12-28 01:57:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:06,789 INFO L462 AbstractCegarLoop]: Abstraction has 152003 states and 663356 transitions. [2019-12-28 01:57:06,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:57:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 152003 states and 663356 transitions. [2019-12-28 01:57:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:06,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:06,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:06,884 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:57:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash -246058056, now seen corresponding path program 1 times [2019-12-28 01:57:06,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:06,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522139684] [2019-12-28 01:57:06,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:07,059 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-28 01:57:07,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522139684] [2019-12-28 01:57:07,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:07,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:57:07,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341451697] [2019-12-28 01:57:07,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:07,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:07,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 185 transitions. [2019-12-28 01:57:07,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:07,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:57:07,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:57:07,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:57:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:57:07,144 INFO L87 Difference]: Start difference. First operand 152003 states and 663356 transitions. Second operand 8 states. [2019-12-28 01:57:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:10,336 INFO L93 Difference]: Finished difference Result 196527 states and 843641 transitions. [2019-12-28 01:57:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:57:10,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-28 01:57:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:10,978 INFO L225 Difference]: With dead ends: 196527 [2019-12-28 01:57:10,978 INFO L226 Difference]: Without dead ends: 193927 [2019-12-28 01:57:10,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 01:57:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193927 states. [2019-12-28 01:57:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193927 to 153899. [2019-12-28 01:57:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153899 states. [2019-12-28 01:57:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153899 states to 153899 states and 672398 transitions. [2019-12-28 01:57:22,583 INFO L78 Accepts]: Start accepts. Automaton has 153899 states and 672398 transitions. Word has length 65 [2019-12-28 01:57:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:22,583 INFO L462 AbstractCegarLoop]: Abstraction has 153899 states and 672398 transitions. [2019-12-28 01:57:22,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:57:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 153899 states and 672398 transitions. [2019-12-28 01:57:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:22,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:22,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:22,626 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:57:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash 445459117, now seen corresponding path program 1 times [2019-12-28 01:57:22,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:22,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165051633] [2019-12-28 01:57:22,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:22,765 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-28 01:57:22,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165051633] [2019-12-28 01:57:22,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:22,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:57:22,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094664152] [2019-12-28 01:57:22,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:22,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:22,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:57:22,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:22,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:57:22,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:57:22,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:22,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:57:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:57:22,817 INFO L87 Difference]: Start difference. First operand 153899 states and 672398 transitions. Second operand 8 states. [2019-12-28 01:57:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:30,669 INFO L93 Difference]: Finished difference Result 213003 states and 921030 transitions. [2019-12-28 01:57:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:57:30,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-28 01:57:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:31,437 INFO L225 Difference]: With dead ends: 213003 [2019-12-28 01:57:31,438 INFO L226 Difference]: Without dead ends: 209099 [2019-12-28 01:57:31,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:57:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209099 states. [2019-12-28 01:57:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209099 to 196111. [2019-12-28 01:57:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196111 states. [2019-12-28 01:57:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196111 states to 196111 states and 850981 transitions. [2019-12-28 01:57:37,555 INFO L78 Accepts]: Start accepts. Automaton has 196111 states and 850981 transitions. Word has length 65 [2019-12-28 01:57:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:37,555 INFO L462 AbstractCegarLoop]: Abstraction has 196111 states and 850981 transitions. [2019-12-28 01:57:37,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:57:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 196111 states and 850981 transitions. [2019-12-28 01:57:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:37,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:57:37,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:57:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1351492242, now seen corresponding path program 1 times [2019-12-28 01:57:37,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:37,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175387691] [2019-12-28 01:57:37,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:37,746 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-28 01:57:37,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175387691] [2019-12-28 01:57:37,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:37,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:57:37,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [162222793] [2019-12-28 01:57:37,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:37,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:38,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:57:38,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:39,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:57:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:57:39,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:39,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:57:39,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:57:39,002 INFO L87 Difference]: Start difference. First operand 196111 states and 850981 transitions. Second operand 9 states. [2019-12-28 01:57:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:57:49,051 INFO L93 Difference]: Finished difference Result 284571 states and 1194514 transitions. [2019-12-28 01:57:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:57:49,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-28 01:57:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:57:50,067 INFO L225 Difference]: With dead ends: 284571 [2019-12-28 01:57:50,067 INFO L226 Difference]: Without dead ends: 284571 [2019-12-28 01:57:50,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:57:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284571 states. [2019-12-28 01:57:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284571 to 232543. [2019-12-28 01:57:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232543 states. [2019-12-28 01:57:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232543 states to 232543 states and 990001 transitions. [2019-12-28 01:57:57,738 INFO L78 Accepts]: Start accepts. Automaton has 232543 states and 990001 transitions. Word has length 65 [2019-12-28 01:57:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:57:57,739 INFO L462 AbstractCegarLoop]: Abstraction has 232543 states and 990001 transitions. [2019-12-28 01:57:57,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:57:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 232543 states and 990001 transitions. [2019-12-28 01:57:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:57:57,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:57:57,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:57:57,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:57:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:57:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash -463988561, now seen corresponding path program 1 times [2019-12-28 01:57:57,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:57:57,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706625252] [2019-12-28 01:57:57,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:57:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:57:57,909 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-28 01:57:57,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706625252] [2019-12-28 01:57:57,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:57:57,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:57:57,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841229891] [2019-12-28 01:57:57,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:57:57,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:57:57,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 69 transitions. [2019-12-28 01:57:57,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:57:57,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:57:57,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:57:57,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:57:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:57:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:57:57,931 INFO L87 Difference]: Start difference. First operand 232543 states and 990001 transitions. Second operand 4 states. [2019-12-28 01:58:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:04,908 INFO L93 Difference]: Finished difference Result 189770 states and 786511 transitions. [2019-12-28 01:58:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:04,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 01:58:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:05,512 INFO L225 Difference]: With dead ends: 189770 [2019-12-28 01:58:05,512 INFO L226 Difference]: Without dead ends: 183774 [2019-12-28 01:58:05,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183774 states. [2019-12-28 01:58:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183774 to 183774. [2019-12-28 01:58:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183774 states. [2019-12-28 01:58:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183774 states to 183774 states and 765841 transitions. [2019-12-28 01:58:11,160 INFO L78 Accepts]: Start accepts. Automaton has 183774 states and 765841 transitions. Word has length 65 [2019-12-28 01:58:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:11,160 INFO L462 AbstractCegarLoop]: Abstraction has 183774 states and 765841 transitions. [2019-12-28 01:58:11,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 183774 states and 765841 transitions. [2019-12-28 01:58:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 01:58:11,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:11,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:11,201 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1777887569, now seen corresponding path program 1 times [2019-12-28 01:58:11,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:11,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317301443] [2019-12-28 01:58:11,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:11,269 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-28 01:58:11,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317301443] [2019-12-28 01:58:11,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:11,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:58:11,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075604322] [2019-12-28 01:58:11,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:11,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:11,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 88 transitions. [2019-12-28 01:58:11,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:11,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:11,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:58:11,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:58:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:58:11,292 INFO L87 Difference]: Start difference. First operand 183774 states and 765841 transitions. Second operand 3 states. [2019-12-28 01:58:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:13,190 INFO L93 Difference]: Finished difference Result 139581 states and 577901 transitions. [2019-12-28 01:58:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:58:13,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-28 01:58:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:13,598 INFO L225 Difference]: With dead ends: 139581 [2019-12-28 01:58:13,599 INFO L226 Difference]: Without dead ends: 138069 [2019-12-28 01:58:13,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:58:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138069 states. [2019-12-28 01:58:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138069 to 133155. [2019-12-28 01:58:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133155 states. [2019-12-28 01:58:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133155 states to 133155 states and 553583 transitions. [2019-12-28 01:58:23,550 INFO L78 Accepts]: Start accepts. Automaton has 133155 states and 553583 transitions. Word has length 66 [2019-12-28 01:58:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 133155 states and 553583 transitions. [2019-12-28 01:58:23,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:58:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 133155 states and 553583 transitions. [2019-12-28 01:58:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:58:23,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:23,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:23,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -356129489, now seen corresponding path program 1 times [2019-12-28 01:58:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:23,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520666602] [2019-12-28 01:58:23,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:24,634 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-28 01:58:24,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520666602] [2019-12-28 01:58:24,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:24,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:24,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919717479] [2019-12-28 01:58:24,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:24,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:24,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 83 transitions. [2019-12-28 01:58:24,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:24,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:24,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:24,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:24,654 INFO L87 Difference]: Start difference. First operand 133155 states and 553583 transitions. Second operand 6 states. [2019-12-28 01:58:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:26,035 INFO L93 Difference]: Finished difference Result 171144 states and 693299 transitions. [2019-12-28 01:58:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:58:26,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 01:58:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:32,316 INFO L225 Difference]: With dead ends: 171144 [2019-12-28 01:58:32,316 INFO L226 Difference]: Without dead ends: 171144 [2019-12-28 01:58:32,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:58:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171144 states. [2019-12-28 01:58:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171144 to 145080. [2019-12-28 01:58:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145080 states. [2019-12-28 01:58:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145080 states to 145080 states and 595922 transitions. [2019-12-28 01:58:36,298 INFO L78 Accepts]: Start accepts. Automaton has 145080 states and 595922 transitions. Word has length 67 [2019-12-28 01:58:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:36,298 INFO L462 AbstractCegarLoop]: Abstraction has 145080 states and 595922 transitions. [2019-12-28 01:58:36,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 145080 states and 595922 transitions. [2019-12-28 01:58:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:58:36,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:36,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:36,325 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 531374192, now seen corresponding path program 1 times [2019-12-28 01:58:36,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:36,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359988821] [2019-12-28 01:58:36,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:58:36,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359988821] [2019-12-28 01:58:36,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:36,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:58:36,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309180203] [2019-12-28 01:58:36,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:36,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:36,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 83 transitions. [2019-12-28 01:58:36,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:36,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:36,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:58:36,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:58:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:36,432 INFO L87 Difference]: Start difference. First operand 145080 states and 595922 transitions. Second operand 5 states. [2019-12-28 01:58:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:36,614 INFO L93 Difference]: Finished difference Result 26547 states and 98280 transitions. [2019-12-28 01:58:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:58:36,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 01:58:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:36,657 INFO L225 Difference]: With dead ends: 26547 [2019-12-28 01:58:36,658 INFO L226 Difference]: Without dead ends: 22041 [2019-12-28 01:58:36,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:58:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22041 states. [2019-12-28 01:58:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22041 to 21849. [2019-12-28 01:58:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21849 states. [2019-12-28 01:58:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21849 states to 21849 states and 79588 transitions. [2019-12-28 01:58:38,039 INFO L78 Accepts]: Start accepts. Automaton has 21849 states and 79588 transitions. Word has length 67 [2019-12-28 01:58:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:38,039 INFO L462 AbstractCegarLoop]: Abstraction has 21849 states and 79588 transitions. [2019-12-28 01:58:38,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:58:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21849 states and 79588 transitions. [2019-12-28 01:58:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 01:58:38,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:38,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:38,051 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1222369499, now seen corresponding path program 1 times [2019-12-28 01:58:38,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318749029] [2019-12-28 01:58:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:38,135 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-28 01:58:38,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318749029] [2019-12-28 01:58:38,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:38,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:38,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172333356] [2019-12-28 01:58:38,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:38,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:38,193 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 228 transitions. [2019-12-28 01:58:38,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:38,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:38,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:38,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:38,196 INFO L87 Difference]: Start difference. First operand 21849 states and 79588 transitions. Second operand 4 states. [2019-12-28 01:58:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:38,433 INFO L93 Difference]: Finished difference Result 25695 states and 92964 transitions. [2019-12-28 01:58:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:38,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-28 01:58:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:38,482 INFO L225 Difference]: With dead ends: 25695 [2019-12-28 01:58:38,483 INFO L226 Difference]: Without dead ends: 25695 [2019-12-28 01:58:38,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25695 states. [2019-12-28 01:58:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25695 to 23607. [2019-12-28 01:58:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2019-12-28 01:58:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 85590 transitions. [2019-12-28 01:58:38,867 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 85590 transitions. Word has length 76 [2019-12-28 01:58:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:38,867 INFO L462 AbstractCegarLoop]: Abstraction has 23607 states and 85590 transitions. [2019-12-28 01:58:38,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 85590 transitions. [2019-12-28 01:58:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-28 01:58:38,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:38,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:38,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 520440836, now seen corresponding path program 1 times [2019-12-28 01:58:38,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:38,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381053965] [2019-12-28 01:58:38,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:38,945 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-28 01:58:38,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381053965] [2019-12-28 01:58:38,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:38,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:38,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368103204] [2019-12-28 01:58:38,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:38,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:39,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 228 transitions. [2019-12-28 01:58:39,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:39,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:39,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:39,002 INFO L87 Difference]: Start difference. First operand 23607 states and 85590 transitions. Second operand 6 states. [2019-12-28 01:58:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:39,459 INFO L93 Difference]: Finished difference Result 30243 states and 108463 transitions. [2019-12-28 01:58:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:58:39,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-28 01:58:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:39,518 INFO L225 Difference]: With dead ends: 30243 [2019-12-28 01:58:39,518 INFO L226 Difference]: Without dead ends: 30063 [2019-12-28 01:58:39,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:58:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30063 states. [2019-12-28 01:58:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30063 to 26285. [2019-12-28 01:58:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26285 states. [2019-12-28 01:58:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26285 states to 26285 states and 94910 transitions. [2019-12-28 01:58:40,254 INFO L78 Accepts]: Start accepts. Automaton has 26285 states and 94910 transitions. Word has length 76 [2019-12-28 01:58:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:40,254 INFO L462 AbstractCegarLoop]: Abstraction has 26285 states and 94910 transitions. [2019-12-28 01:58:40,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26285 states and 94910 transitions. [2019-12-28 01:58:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:40,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:40,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:40,274 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1316883782, now seen corresponding path program 1 times [2019-12-28 01:58:40,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:40,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001811466] [2019-12-28 01:58:40,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:40,339 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-28 01:58:40,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001811466] [2019-12-28 01:58:40,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:40,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:40,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956592376] [2019-12-28 01:58:40,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:40,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:40,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:40,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:40,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:40,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:40,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:40,379 INFO L87 Difference]: Start difference. First operand 26285 states and 94910 transitions. Second operand 4 states. [2019-12-28 01:58:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:40,725 INFO L93 Difference]: Finished difference Result 34919 states and 124771 transitions. [2019-12-28 01:58:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:58:40,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-28 01:58:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:40,792 INFO L225 Difference]: With dead ends: 34919 [2019-12-28 01:58:40,792 INFO L226 Difference]: Without dead ends: 34919 [2019-12-28 01:58:40,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34919 states. [2019-12-28 01:58:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34919 to 29738. [2019-12-28 01:58:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29738 states. [2019-12-28 01:58:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29738 states to 29738 states and 106663 transitions. [2019-12-28 01:58:41,725 INFO L78 Accepts]: Start accepts. Automaton has 29738 states and 106663 transitions. Word has length 80 [2019-12-28 01:58:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:41,725 INFO L462 AbstractCegarLoop]: Abstraction has 29738 states and 106663 transitions. [2019-12-28 01:58:41,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29738 states and 106663 transitions. [2019-12-28 01:58:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:41,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:41,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:41,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1733319033, now seen corresponding path program 1 times [2019-12-28 01:58:41,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:41,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368512880] [2019-12-28 01:58:41,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:41,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-28 01:58:41,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368512880] [2019-12-28 01:58:41,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:41,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:41,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904075173] [2019-12-28 01:58:41,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:41,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:41,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:41,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:41,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:58:41,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:41,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:41,892 INFO L87 Difference]: Start difference. First operand 29738 states and 106663 transitions. Second operand 6 states. [2019-12-28 01:58:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:42,647 INFO L93 Difference]: Finished difference Result 34483 states and 121692 transitions. [2019-12-28 01:58:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:58:42,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:42,762 INFO L225 Difference]: With dead ends: 34483 [2019-12-28 01:58:42,762 INFO L226 Difference]: Without dead ends: 34483 [2019-12-28 01:58:42,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:58:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34483 states. [2019-12-28 01:58:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34483 to 33418. [2019-12-28 01:58:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33418 states. [2019-12-28 01:58:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33418 states to 33418 states and 118241 transitions. [2019-12-28 01:58:43,349 INFO L78 Accepts]: Start accepts. Automaton has 33418 states and 118241 transitions. Word has length 80 [2019-12-28 01:58:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:43,349 INFO L462 AbstractCegarLoop]: Abstraction has 33418 states and 118241 transitions. [2019-12-28 01:58:43,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33418 states and 118241 transitions. [2019-12-28 01:58:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:43,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:43,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:43,373 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 484438920, now seen corresponding path program 1 times [2019-12-28 01:58:43,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:43,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921792523] [2019-12-28 01:58:43,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:43,468 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-28 01:58:43,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921792523] [2019-12-28 01:58:43,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:43,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:43,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222260387] [2019-12-28 01:58:43,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:43,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:43,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:43,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:43,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:43,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:43,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:43,506 INFO L87 Difference]: Start difference. First operand 33418 states and 118241 transitions. Second operand 6 states. [2019-12-28 01:58:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:44,295 INFO L93 Difference]: Finished difference Result 39886 states and 137569 transitions. [2019-12-28 01:58:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:58:44,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:44,367 INFO L225 Difference]: With dead ends: 39886 [2019-12-28 01:58:44,367 INFO L226 Difference]: Without dead ends: 39886 [2019-12-28 01:58:44,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:58:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39886 states. [2019-12-28 01:58:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39886 to 34246. [2019-12-28 01:58:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34246 states. [2019-12-28 01:58:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34246 states to 34246 states and 119107 transitions. [2019-12-28 01:58:44,910 INFO L78 Accepts]: Start accepts. Automaton has 34246 states and 119107 transitions. Word has length 80 [2019-12-28 01:58:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:44,910 INFO L462 AbstractCegarLoop]: Abstraction has 34246 states and 119107 transitions. [2019-12-28 01:58:44,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 34246 states and 119107 transitions. [2019-12-28 01:58:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:44,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:44,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:44,935 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 695789833, now seen corresponding path program 1 times [2019-12-28 01:58:44,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:44,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034391390] [2019-12-28 01:58:44,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:45,004 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-28 01:58:45,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034391390] [2019-12-28 01:58:45,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:45,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:58:45,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001392441] [2019-12-28 01:58:45,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:45,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:45,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:45,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:45,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:58:45,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:58:45,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:58:45,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:45,048 INFO L87 Difference]: Start difference. First operand 34246 states and 119107 transitions. Second operand 5 states. [2019-12-28 01:58:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:45,456 INFO L93 Difference]: Finished difference Result 41651 states and 144391 transitions. [2019-12-28 01:58:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:58:45,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-28 01:58:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:45,530 INFO L225 Difference]: With dead ends: 41651 [2019-12-28 01:58:45,530 INFO L226 Difference]: Without dead ends: 41651 [2019-12-28 01:58:45,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:58:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41651 states. [2019-12-28 01:58:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41651 to 36968. [2019-12-28 01:58:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36968 states. [2019-12-28 01:58:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36968 states to 36968 states and 127710 transitions. [2019-12-28 01:58:46,394 INFO L78 Accepts]: Start accepts. Automaton has 36968 states and 127710 transitions. Word has length 80 [2019-12-28 01:58:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:46,394 INFO L462 AbstractCegarLoop]: Abstraction has 36968 states and 127710 transitions. [2019-12-28 01:58:46,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:58:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36968 states and 127710 transitions. [2019-12-28 01:58:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:46,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:46,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:46,423 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash 185255656, now seen corresponding path program 1 times [2019-12-28 01:58:46,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:46,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946776254] [2019-12-28 01:58:46,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:46,473 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-28 01:58:46,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946776254] [2019-12-28 01:58:46,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:46,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:58:46,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874977863] [2019-12-28 01:58:46,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:46,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:46,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:46,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:46,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:46,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:58:46,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:58:46,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:58:46,520 INFO L87 Difference]: Start difference. First operand 36968 states and 127710 transitions. Second operand 4 states. [2019-12-28 01:58:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:47,138 INFO L93 Difference]: Finished difference Result 44717 states and 154917 transitions. [2019-12-28 01:58:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:58:47,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-28 01:58:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:47,222 INFO L225 Difference]: With dead ends: 44717 [2019-12-28 01:58:47,222 INFO L226 Difference]: Without dead ends: 43574 [2019-12-28 01:58:47,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:58:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43574 states. [2019-12-28 01:58:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43574 to 41927. [2019-12-28 01:58:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41927 states. [2019-12-28 01:58:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41927 states to 41927 states and 144888 transitions. [2019-12-28 01:58:48,217 INFO L78 Accepts]: Start accepts. Automaton has 41927 states and 144888 transitions. Word has length 80 [2019-12-28 01:58:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:48,218 INFO L462 AbstractCegarLoop]: Abstraction has 41927 states and 144888 transitions. [2019-12-28 01:58:48,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:58:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41927 states and 144888 transitions. [2019-12-28 01:58:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:48,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:48,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:48,249 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1611695703, now seen corresponding path program 1 times [2019-12-28 01:58:48,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:48,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841569468] [2019-12-28 01:58:48,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:48,371 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-28 01:58:48,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841569468] [2019-12-28 01:58:48,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:48,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:48,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654897562] [2019-12-28 01:58:48,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:48,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:48,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:48,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:48,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:48,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:58:48,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:58:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:58:48,407 INFO L87 Difference]: Start difference. First operand 41927 states and 144888 transitions. Second operand 7 states. [2019-12-28 01:58:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:49,076 INFO L93 Difference]: Finished difference Result 50830 states and 173172 transitions. [2019-12-28 01:58:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:58:49,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-28 01:58:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:49,177 INFO L225 Difference]: With dead ends: 50830 [2019-12-28 01:58:49,177 INFO L226 Difference]: Without dead ends: 50830 [2019-12-28 01:58:49,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:58:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50830 states. [2019-12-28 01:58:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50830 to 39793. [2019-12-28 01:58:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39793 states. [2019-12-28 01:58:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39793 states to 39793 states and 135816 transitions. [2019-12-28 01:58:50,318 INFO L78 Accepts]: Start accepts. Automaton has 39793 states and 135816 transitions. Word has length 80 [2019-12-28 01:58:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:50,319 INFO L462 AbstractCegarLoop]: Abstraction has 39793 states and 135816 transitions. [2019-12-28 01:58:50,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:58:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39793 states and 135816 transitions. [2019-12-28 01:58:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 01:58:50,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:50,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:58:50,345 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash -724192022, now seen corresponding path program 1 times [2019-12-28 01:58:50,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:50,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901563262] [2019-12-28 01:58:50,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:50,427 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-28 01:58:50,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901563262] [2019-12-28 01:58:50,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:50,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:58:50,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033002517] [2019-12-28 01:58:50,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:50,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:50,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 100 transitions. [2019-12-28 01:58:50,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:50,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:58:50,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:58:50,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:58:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:58:50,467 INFO L87 Difference]: Start difference. First operand 39793 states and 135816 transitions. Second operand 6 states. [2019-12-28 01:58:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:50,602 INFO L93 Difference]: Finished difference Result 15205 states and 46377 transitions. [2019-12-28 01:58:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:58:50,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 01:58:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:50,629 INFO L225 Difference]: With dead ends: 15205 [2019-12-28 01:58:50,629 INFO L226 Difference]: Without dead ends: 13056 [2019-12-28 01:58:50,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:58:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2019-12-28 01:58:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 12016. [2019-12-28 01:58:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12016 states. [2019-12-28 01:58:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 36483 transitions. [2019-12-28 01:58:50,947 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 36483 transitions. Word has length 80 [2019-12-28 01:58:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:50,947 INFO L462 AbstractCegarLoop]: Abstraction has 12016 states and 36483 transitions. [2019-12-28 01:58:50,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:58:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 36483 transitions. [2019-12-28 01:58:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:50,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:50,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:50,973 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1499343217, now seen corresponding path program 1 times [2019-12-28 01:58:50,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:50,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355581363] [2019-12-28 01:58:50,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:51,112 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-28 01:58:51,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355581363] [2019-12-28 01:58:51,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:51,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:51,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538718747] [2019-12-28 01:58:51,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:51,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:51,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 311 transitions. [2019-12-28 01:58:51,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:51,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 01:58:51,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:58:51,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:58:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:58:51,308 INFO L87 Difference]: Start difference. First operand 12016 states and 36483 transitions. Second operand 10 states. [2019-12-28 01:58:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:53,154 INFO L93 Difference]: Finished difference Result 24183 states and 72345 transitions. [2019-12-28 01:58:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 01:58:53,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-28 01:58:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:53,202 INFO L225 Difference]: With dead ends: 24183 [2019-12-28 01:58:53,202 INFO L226 Difference]: Without dead ends: 23995 [2019-12-28 01:58:53,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-28 01:58:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23995 states. [2019-12-28 01:58:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23995 to 13312. [2019-12-28 01:58:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13312 states. [2019-12-28 01:58:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13312 states to 13312 states and 40395 transitions. [2019-12-28 01:58:53,447 INFO L78 Accepts]: Start accepts. Automaton has 13312 states and 40395 transitions. Word has length 97 [2019-12-28 01:58:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:53,447 INFO L462 AbstractCegarLoop]: Abstraction has 13312 states and 40395 transitions. [2019-12-28 01:58:53,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:58:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13312 states and 40395 transitions. [2019-12-28 01:58:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:53,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:53,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:53,524 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash -577866126, now seen corresponding path program 1 times [2019-12-28 01:58:53,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:53,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575966544] [2019-12-28 01:58:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:53,702 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-28 01:58:53,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575966544] [2019-12-28 01:58:53,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:53,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:58:53,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979693060] [2019-12-28 01:58:53,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:53,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:53,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 311 transitions. [2019-12-28 01:58:53,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:53,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:58:53,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:58:53,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:58:53,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:58:53,956 INFO L87 Difference]: Start difference. First operand 13312 states and 40395 transitions. Second operand 9 states. [2019-12-28 01:58:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:58:54,561 INFO L93 Difference]: Finished difference Result 26647 states and 79748 transitions. [2019-12-28 01:58:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:58:54,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 01:58:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:58:54,598 INFO L225 Difference]: With dead ends: 26647 [2019-12-28 01:58:54,598 INFO L226 Difference]: Without dead ends: 23791 [2019-12-28 01:58:54,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-28 01:58:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23791 states. [2019-12-28 01:58:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23791 to 14677. [2019-12-28 01:58:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14677 states. [2019-12-28 01:58:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14677 states to 14677 states and 44477 transitions. [2019-12-28 01:58:54,847 INFO L78 Accepts]: Start accepts. Automaton has 14677 states and 44477 transitions. Word has length 97 [2019-12-28 01:58:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:58:54,847 INFO L462 AbstractCegarLoop]: Abstraction has 14677 states and 44477 transitions. [2019-12-28 01:58:54,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:58:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14677 states and 44477 transitions. [2019-12-28 01:58:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 01:58:54,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:58:54,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 01:58:54,863 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:58:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:58:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1737016014, now seen corresponding path program 2 times [2019-12-28 01:58:54,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:58:54,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646786037] [2019-12-28 01:58:54,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:58:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:58:54,999 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-28 01:58:55,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646786037] [2019-12-28 01:58:55,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:58:55,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:58:55,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535777497] [2019-12-28 01:58:55,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:58:55,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:58:55,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 281 transitions. [2019-12-28 01:58:55,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:58:55,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:58:55,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 01:58:55,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:58:55,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 01:58:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:58:55,288 INFO L87 Difference]: Start difference. First operand 14677 states and 44477 transitions. Second operand 14 states. Received shutdown request... [2019-12-28 01:58:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-28 01:58:58,609 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 01:58:58,613 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 01:58:58,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:58:58 BasicIcfg [2019-12-28 01:58:58,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:58:58,616 INFO L168 Benchmark]: Toolchain (without parser) took 184794.97 ms. Allocated memory was 138.9 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 102.3 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,617 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.23 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,618 INFO L168 Benchmark]: Boogie Preprocessor took 55.56 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,618 INFO L168 Benchmark]: RCFGBuilder took 791.42 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,619 INFO L168 Benchmark]: TraceAbstraction took 183124.43 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 107.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 01:58:58,622 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.23 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.56 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.42 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183124.43 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 107.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (14677states) and FLOYD_HOARE automaton (currently 38 states, 14 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (14677states) and FLOYD_HOARE automaton (currently 38 states, 14 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: TIMEOUT, OverallTime: 182.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 75.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6673 SDtfs, 10626 SDslu, 18645 SDs, 0 SdLazy, 7463 SolverSat, 484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 101 SyntacticMatches, 9 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232543occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 82.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 239150 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1691 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1668 ConstructedInterpolants, 0 QuantifiedInterpolants, 368373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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