/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/mix035_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:05:20,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:05:20,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:05:20,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:05:20,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:05:20,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:05:20,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:05:20,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:05:20,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:05:20,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:05:20,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:05:20,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:05:20,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:05:20,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:05:20,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:05:20,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:05:20,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:05:20,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:05:20,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:05:20,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:05:20,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:05:20,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:05:20,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:05:20,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:05:20,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:05:20,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:05:20,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:05:20,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:05:20,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:05:20,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:05:20,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:05:20,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:05:20,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:05:20,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:05:20,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:05:20,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:05:20,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:05:20,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:05:20,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:05:20,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:05:20,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:05:20,630 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 02:05:20,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:05:20,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:05:20,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:05:20,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:05:20,665 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:05:20,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:05:20,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:05:20,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:05:20,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:05:20,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:05:20,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:05:20,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:05:20,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:05:20,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:05:20,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:05:20,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:05:20,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:05:20,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:05:20,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:05:20,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:05:20,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:05:20,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:05:20,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:05:20,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:05:20,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:05:20,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:05:20,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:05:20,672 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:05:20,672 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:05:20,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:05:20,673 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:05:20,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:05:20,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:05:20,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:05:20,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:05:20,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:05:20,955 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:05:20,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-28 02:05:21,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcca03f04/cdfd28cecd2c48c7bddd9bf3d538c44e/FLAG0684bc63f [2019-12-28 02:05:21,619 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:05:21,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-28 02:05:21,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcca03f04/cdfd28cecd2c48c7bddd9bf3d538c44e/FLAG0684bc63f [2019-12-28 02:05:21,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcca03f04/cdfd28cecd2c48c7bddd9bf3d538c44e [2019-12-28 02:05:21,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:05:21,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:05:21,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:05:21,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:05:21,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:05:21,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:05:21" (1/1) ... [2019-12-28 02:05:21,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:21, skipping insertion in model container [2019-12-28 02:05:21,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:05:21" (1/1) ... [2019-12-28 02:05:21,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:05:21,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:05:22,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:05:22,483 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:05:22,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:05:22,646 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:05:22,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22 WrapperNode [2019-12-28 02:05:22,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:05:22,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:05:22,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:05:22,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:05:22,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:05:22,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:05:22,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:05:22,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:05:22,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (1/1) ... [2019-12-28 02:05:22,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:05:22,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:05:22,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:05:22,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:05:22,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (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 02:05:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:05:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:05:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:05:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:05:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:05:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:05:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:05:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:05:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 02:05:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 02:05:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:05:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:05:22,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:05:22,831 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 02:05:23,457 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:05:23,458 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:05:23,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:05:23 BoogieIcfgContainer [2019-12-28 02:05:23,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:05:23,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:05:23,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:05:23,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:05:23,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:05:21" (1/3) ... [2019-12-28 02:05:23,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:05:23, skipping insertion in model container [2019-12-28 02:05:23,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:05:22" (2/3) ... [2019-12-28 02:05:23,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:05:23, skipping insertion in model container [2019-12-28 02:05:23,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:05:23" (3/3) ... [2019-12-28 02:05:23,469 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt.i [2019-12-28 02:05:23,480 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:05:23,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:05:23,501 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:05:23,502 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:05:23,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,635 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,653 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,654 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:05:23,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 02:05:23,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:05:23,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:05:23,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:05:23,712 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:05:23,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:05:23,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:05:23,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:05:23,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:05:23,729 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 179 transitions [2019-12-28 02:05:41,845 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111189 states. [2019-12-28 02:05:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 111189 states. [2019-12-28 02:05:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:05:41,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:05:41,865 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] [2019-12-28 02:05:41,866 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 02:05:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:05:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -592016496, now seen corresponding path program 1 times [2019-12-28 02:05:41,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:05:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983604926] [2019-12-28 02:05:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:05:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:05:42,227 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 02:05:42,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983604926] [2019-12-28 02:05:42,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:05:42,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:05:42,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134517632] [2019-12-28 02:05:42,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:05:42,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:05:42,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:05:42,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:05:42,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:05:42,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:05:42,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:05:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:05:42,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:05:42,287 INFO L87 Difference]: Start difference. First operand 111189 states. Second operand 4 states. [2019-12-28 02:05:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:05:46,323 INFO L93 Difference]: Finished difference Result 114117 states and 522353 transitions. [2019-12-28 02:05:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:05:46,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-28 02:05:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:05:47,049 INFO L225 Difference]: With dead ends: 114117 [2019-12-28 02:05:47,050 INFO L226 Difference]: Without dead ends: 82837 [2019-12-28 02:05:47,052 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 02:05:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82837 states. [2019-12-28 02:05:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82837 to 82837. [2019-12-28 02:05:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82837 states. [2019-12-28 02:05:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82837 states to 82837 states and 380413 transitions. [2019-12-28 02:05:53,723 INFO L78 Accepts]: Start accepts. Automaton has 82837 states and 380413 transitions. Word has length 48 [2019-12-28 02:05:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:05:53,724 INFO L462 AbstractCegarLoop]: Abstraction has 82837 states and 380413 transitions. [2019-12-28 02:05:53,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:05:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82837 states and 380413 transitions. [2019-12-28 02:05:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 02:05:53,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:05:53,743 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] [2019-12-28 02:05:53,743 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 02:05:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:05:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1323631444, now seen corresponding path program 1 times [2019-12-28 02:05:53,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:05:53,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947948562] [2019-12-28 02:05:53,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:05:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:05:53,885 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 02:05:53,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947948562] [2019-12-28 02:05:53,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:05:53,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:05:53,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745123634] [2019-12-28 02:05:53,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:05:53,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:05:53,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 02:05:53,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:05:53,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:05:53,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:05:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:05:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:05:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:05:53,904 INFO L87 Difference]: Start difference. First operand 82837 states and 380413 transitions. Second operand 5 states. [2019-12-28 02:05:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:05:59,005 INFO L93 Difference]: Finished difference Result 129237 states and 566705 transitions. [2019-12-28 02:05:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:05:59,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-28 02:05:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:05:59,737 INFO L225 Difference]: With dead ends: 129237 [2019-12-28 02:05:59,737 INFO L226 Difference]: Without dead ends: 126477 [2019-12-28 02:05:59,738 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 02:06:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126477 states. [2019-12-28 02:06:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126477 to 119961. [2019-12-28 02:06:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119961 states. [2019-12-28 02:06:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119961 states to 119961 states and 531552 transitions. [2019-12-28 02:06:03,683 INFO L78 Accepts]: Start accepts. Automaton has 119961 states and 531552 transitions. Word has length 56 [2019-12-28 02:06:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:06:03,684 INFO L462 AbstractCegarLoop]: Abstraction has 119961 states and 531552 transitions. [2019-12-28 02:06:03,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:06:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 119961 states and 531552 transitions. [2019-12-28 02:06:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 02:06:03,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:06:03,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:06:03,701 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 02:06:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:06:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1181762084, now seen corresponding path program 1 times [2019-12-28 02:06:03,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:06:03,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645364765] [2019-12-28 02:06:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:06:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:06:03,818 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 02:06:03,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645364765] [2019-12-28 02:06:03,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:06:03,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:06:03,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312573914] [2019-12-28 02:06:03,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:06:03,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:06:03,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-28 02:06:03,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:06:03,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:06:03,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:06:03,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:06:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:06:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:06:03,926 INFO L87 Difference]: Start difference. First operand 119961 states and 531552 transitions. Second operand 6 states. [2019-12-28 02:06:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:06:09,572 INFO L93 Difference]: Finished difference Result 156373 states and 680701 transitions. [2019-12-28 02:06:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:06:09,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-28 02:06:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:06:10,277 INFO L225 Difference]: With dead ends: 156373 [2019-12-28 02:06:10,277 INFO L226 Difference]: Without dead ends: 154133 [2019-12-28 02:06:10,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:06:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154133 states. [2019-12-28 02:06:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154133 to 132945. [2019-12-28 02:06:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132945 states. [2019-12-28 02:06:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132945 states to 132945 states and 585326 transitions. [2019-12-28 02:06:15,760 INFO L78 Accepts]: Start accepts. Automaton has 132945 states and 585326 transitions. Word has length 57 [2019-12-28 02:06:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:06:15,760 INFO L462 AbstractCegarLoop]: Abstraction has 132945 states and 585326 transitions. [2019-12-28 02:06:15,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:06:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 132945 states and 585326 transitions. [2019-12-28 02:06:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-28 02:06:15,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:06:15,802 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 02:06:15,802 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 02:06:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:06:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash -918469598, now seen corresponding path program 1 times [2019-12-28 02:06:15,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:06:15,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871299870] [2019-12-28 02:06:15,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:06:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:06:15,893 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 02:06:15,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871299870] [2019-12-28 02:06:15,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:06:15,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:06:15,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007715659] [2019-12-28 02:06:15,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:06:15,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:06:15,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 147 transitions. [2019-12-28 02:06:15,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:06:15,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:06:15,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:06:15,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:06:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:06:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:06:15,972 INFO L87 Difference]: Start difference. First operand 132945 states and 585326 transitions. Second operand 5 states. [2019-12-28 02:06:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:06:22,269 INFO L93 Difference]: Finished difference Result 171277 states and 741343 transitions. [2019-12-28 02:06:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:06:22,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-28 02:06:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:06:22,839 INFO L225 Difference]: With dead ends: 171277 [2019-12-28 02:06:22,839 INFO L226 Difference]: Without dead ends: 171277 [2019-12-28 02:06:22,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:06:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171277 states. [2019-12-28 02:06:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171277 to 152001. [2019-12-28 02:06:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152001 states. [2019-12-28 02:06:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152001 states to 152001 states and 663354 transitions. [2019-12-28 02:06:32,876 INFO L78 Accepts]: Start accepts. Automaton has 152001 states and 663354 transitions. Word has length 59 [2019-12-28 02:06:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:06:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 152001 states and 663354 transitions. [2019-12-28 02:06:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:06:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 152001 states and 663354 transitions. [2019-12-28 02:06:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:06:32,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:06:32,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:06:32,921 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 02:06:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:06:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash -972560275, now seen corresponding path program 1 times [2019-12-28 02:06:32,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:06:32,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319316435] [2019-12-28 02:06:32,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:06:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:06:33,020 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 02:06:33,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319316435] [2019-12-28 02:06:33,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:06:33,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:06:33,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910933408] [2019-12-28 02:06:33,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:06:33,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:06:33,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 183 transitions. [2019-12-28 02:06:33,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:06:33,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:06:33,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:06:33,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:06:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:06:33,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:06:33,105 INFO L87 Difference]: Start difference. First operand 152001 states and 663354 transitions. Second operand 8 states. [2019-12-28 02:06:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:06:35,506 INFO L93 Difference]: Finished difference Result 196525 states and 843639 transitions. [2019-12-28 02:06:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:06:35,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-28 02:06:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:06:36,144 INFO L225 Difference]: With dead ends: 196525 [2019-12-28 02:06:36,144 INFO L226 Difference]: Without dead ends: 193925 [2019-12-28 02:06:36,145 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 02:06:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193925 states. [2019-12-28 02:06:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193925 to 153897. [2019-12-28 02:06:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153897 states. [2019-12-28 02:06:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153897 states to 153897 states and 672396 transitions. [2019-12-28 02:06:48,200 INFO L78 Accepts]: Start accepts. Automaton has 153897 states and 672396 transitions. Word has length 63 [2019-12-28 02:06:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:06:48,201 INFO L462 AbstractCegarLoop]: Abstraction has 153897 states and 672396 transitions. [2019-12-28 02:06:48,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:06:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 153897 states and 672396 transitions. [2019-12-28 02:06:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:06:48,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:06:48,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:06:48,241 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 02:06:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:06:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash 416687807, now seen corresponding path program 1 times [2019-12-28 02:06:48,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:06:48,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313546706] [2019-12-28 02:06:48,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:06:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:06:48,372 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 02:06:48,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313546706] [2019-12-28 02:06:48,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:06:48,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:06:48,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716862937] [2019-12-28 02:06:48,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:06:48,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:06:48,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 67 transitions. [2019-12-28 02:06:48,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:06:48,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:06:48,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:06:48,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:06:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:06:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:06:48,434 INFO L87 Difference]: Start difference. First operand 153897 states and 672396 transitions. Second operand 8 states. [2019-12-28 02:06:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:06:51,390 INFO L93 Difference]: Finished difference Result 213001 states and 921028 transitions. [2019-12-28 02:06:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:06:51,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-28 02:06:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:06:58,855 INFO L225 Difference]: With dead ends: 213001 [2019-12-28 02:06:58,855 INFO L226 Difference]: Without dead ends: 209097 [2019-12-28 02:06:58,856 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 02:06:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209097 states. [2019-12-28 02:07:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209097 to 196109. [2019-12-28 02:07:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196109 states. [2019-12-28 02:07:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196109 states to 196109 states and 850979 transitions. [2019-12-28 02:07:04,897 INFO L78 Accepts]: Start accepts. Automaton has 196109 states and 850979 transitions. Word has length 63 [2019-12-28 02:07:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:07:04,897 INFO L462 AbstractCegarLoop]: Abstraction has 196109 states and 850979 transitions. [2019-12-28 02:07:04,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:07:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 196109 states and 850979 transitions. [2019-12-28 02:07:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:07:04,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:07:04,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:07:04,950 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 02:07:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:07:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1380263552, now seen corresponding path program 1 times [2019-12-28 02:07:04,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:07:04,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631347203] [2019-12-28 02:07:04,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:07:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:07:05,115 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 02:07:05,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631347203] [2019-12-28 02:07:05,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:07:05,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:07:05,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053567711] [2019-12-28 02:07:05,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:07:05,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:07:05,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 67 transitions. [2019-12-28 02:07:05,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:07:05,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:07:05,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:07:05,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:07:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:07:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:07:05,160 INFO L87 Difference]: Start difference. First operand 196109 states and 850979 transitions. Second operand 9 states. [2019-12-28 02:07:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:07:13,925 INFO L93 Difference]: Finished difference Result 284569 states and 1194512 transitions. [2019-12-28 02:07:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:07:13,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-28 02:07:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:07:14,888 INFO L225 Difference]: With dead ends: 284569 [2019-12-28 02:07:14,888 INFO L226 Difference]: Without dead ends: 284569 [2019-12-28 02:07:14,888 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 02:07:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284569 states. [2019-12-28 02:07:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284569 to 232541. [2019-12-28 02:07:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232541 states. [2019-12-28 02:07:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232541 states to 232541 states and 989999 transitions. [2019-12-28 02:07:29,195 INFO L78 Accepts]: Start accepts. Automaton has 232541 states and 989999 transitions. Word has length 63 [2019-12-28 02:07:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:07:29,196 INFO L462 AbstractCegarLoop]: Abstraction has 232541 states and 989999 transitions. [2019-12-28 02:07:29,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:07:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 232541 states and 989999 transitions. [2019-12-28 02:07:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:07:29,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:07:29,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:07:29,247 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 02:07:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:07:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash -492759871, now seen corresponding path program 1 times [2019-12-28 02:07:29,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:07:29,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111419124] [2019-12-28 02:07:29,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:07:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:07:29,331 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 02:07:29,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111419124] [2019-12-28 02:07:29,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:07:29,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:07:29,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138937643] [2019-12-28 02:07:29,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:07:29,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:07:29,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 67 transitions. [2019-12-28 02:07:29,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:07:29,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:07:29,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:07:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:07:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:07:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:07:29,352 INFO L87 Difference]: Start difference. First operand 232541 states and 989999 transitions. Second operand 3 states. [2019-12-28 02:07:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:07:36,803 INFO L93 Difference]: Finished difference Result 176405 states and 746629 transitions. [2019-12-28 02:07:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:07:36,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-28 02:07:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:07:37,371 INFO L225 Difference]: With dead ends: 176405 [2019-12-28 02:07:37,371 INFO L226 Difference]: Without dead ends: 174389 [2019-12-28 02:07:37,371 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 02:07:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174389 states. [2019-12-28 02:07:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174389 to 168525. [2019-12-28 02:07:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168525 states. [2019-12-28 02:07:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168525 states to 168525 states and 716203 transitions. [2019-12-28 02:07:43,006 INFO L78 Accepts]: Start accepts. Automaton has 168525 states and 716203 transitions. Word has length 63 [2019-12-28 02:07:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:07:43,007 INFO L462 AbstractCegarLoop]: Abstraction has 168525 states and 716203 transitions. [2019-12-28 02:07:43,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:07:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 168525 states and 716203 transitions. [2019-12-28 02:07:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 02:07:43,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:07:43,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:07:43,047 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 02:07:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:07:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1522967918, now seen corresponding path program 1 times [2019-12-28 02:07:43,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:07:43,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190747713] [2019-12-28 02:07:43,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:07:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:07:43,148 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 02:07:43,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190747713] [2019-12-28 02:07:43,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:07:43,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:07:43,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389557485] [2019-12-28 02:07:43,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:07:43,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:07:43,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 02:07:43,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:07:43,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:07:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:07:43,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:07:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:07:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:07:43,164 INFO L87 Difference]: Start difference. First operand 168525 states and 716203 transitions. Second operand 6 states. [2019-12-28 02:07:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:07:45,987 INFO L93 Difference]: Finished difference Result 219177 states and 906712 transitions. [2019-12-28 02:07:45,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:07:45,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-28 02:07:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:07:54,287 INFO L225 Difference]: With dead ends: 219177 [2019-12-28 02:07:54,288 INFO L226 Difference]: Without dead ends: 219177 [2019-12-28 02:07:54,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:07:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219177 states. [2019-12-28 02:07:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219177 to 184425. [2019-12-28 02:07:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184425 states. [2019-12-28 02:07:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184425 states to 184425 states and 773980 transitions. [2019-12-28 02:07:59,989 INFO L78 Accepts]: Start accepts. Automaton has 184425 states and 773980 transitions. Word has length 64 [2019-12-28 02:07:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:07:59,989 INFO L462 AbstractCegarLoop]: Abstraction has 184425 states and 773980 transitions. [2019-12-28 02:07:59,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:07:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 184425 states and 773980 transitions. [2019-12-28 02:08:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 02:08:00,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:00,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:00,036 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 02:08:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1884495697, now seen corresponding path program 1 times [2019-12-28 02:08:00,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:00,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619702483] [2019-12-28 02:08:00,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:00,115 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 02:08:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619702483] [2019-12-28 02:08:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:08:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766894883] [2019-12-28 02:08:00,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:00,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:00,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 02:08:00,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:00,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:00,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:08:00,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:08:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:08:00,132 INFO L87 Difference]: Start difference. First operand 184425 states and 773980 transitions. Second operand 4 states. [2019-12-28 02:08:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:07,422 INFO L93 Difference]: Finished difference Result 150714 states and 615561 transitions. [2019-12-28 02:08:07,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:08:07,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-28 02:08:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:07,889 INFO L225 Difference]: With dead ends: 150714 [2019-12-28 02:08:07,889 INFO L226 Difference]: Without dead ends: 145078 [2019-12-28 02:08:07,890 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 02:08:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145078 states. [2019-12-28 02:08:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145078 to 145078. [2019-12-28 02:08:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145078 states. [2019-12-28 02:08:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145078 states to 145078 states and 595920 transitions. [2019-12-28 02:08:11,864 INFO L78 Accepts]: Start accepts. Automaton has 145078 states and 595920 transitions. Word has length 64 [2019-12-28 02:08:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:11,864 INFO L462 AbstractCegarLoop]: Abstraction has 145078 states and 595920 transitions. [2019-12-28 02:08:11,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:08:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 145078 states and 595920 transitions. [2019-12-28 02:08:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 02:08:11,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:11,893 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 02:08:11,893 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 02:08:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1328065459, now seen corresponding path program 1 times [2019-12-28 02:08:11,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:11,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319657942] [2019-12-28 02:08:11,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:11,992 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 02:08:11,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319657942] [2019-12-28 02:08:11,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:11,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:08:11,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [110725338] [2019-12-28 02:08:11,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:12,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:12,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 81 transitions. [2019-12-28 02:08:12,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:12,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:12,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:08:12,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:08:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:08:12,015 INFO L87 Difference]: Start difference. First operand 145078 states and 595920 transitions. Second operand 5 states. [2019-12-28 02:08:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:12,214 INFO L93 Difference]: Finished difference Result 26545 states and 98278 transitions. [2019-12-28 02:08:12,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:08:12,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-28 02:08:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:12,257 INFO L225 Difference]: With dead ends: 26545 [2019-12-28 02:08:12,257 INFO L226 Difference]: Without dead ends: 22039 [2019-12-28 02:08:12,258 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 02:08:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22039 states. [2019-12-28 02:08:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22039 to 21847. [2019-12-28 02:08:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21847 states. [2019-12-28 02:08:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21847 states to 21847 states and 79586 transitions. [2019-12-28 02:08:13,631 INFO L78 Accepts]: Start accepts. Automaton has 21847 states and 79586 transitions. Word has length 65 [2019-12-28 02:08:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:13,631 INFO L462 AbstractCegarLoop]: Abstraction has 21847 states and 79586 transitions. [2019-12-28 02:08:13,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:08:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21847 states and 79586 transitions. [2019-12-28 02:08:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 02:08:13,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:13,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:08:13,643 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 02:08:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1654804282, now seen corresponding path program 1 times [2019-12-28 02:08:13,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:13,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089083525] [2019-12-28 02:08:13,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:13,700 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 02:08:13,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089083525] [2019-12-28 02:08:13,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:13,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:08:13,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991653034] [2019-12-28 02:08:13,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:13,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:13,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 226 transitions. [2019-12-28 02:08:13,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:13,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:08:13,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:08:13,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:08:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:08:13,770 INFO L87 Difference]: Start difference. First operand 21847 states and 79586 transitions. Second operand 5 states. [2019-12-28 02:08:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:14,017 INFO L93 Difference]: Finished difference Result 25693 states and 92962 transitions. [2019-12-28 02:08:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:08:14,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-28 02:08:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:14,068 INFO L225 Difference]: With dead ends: 25693 [2019-12-28 02:08:14,068 INFO L226 Difference]: Without dead ends: 25693 [2019-12-28 02:08:14,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:08:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25693 states. [2019-12-28 02:08:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25693 to 23605. [2019-12-28 02:08:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23605 states. [2019-12-28 02:08:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23605 states to 23605 states and 85588 transitions. [2019-12-28 02:08:14,480 INFO L78 Accepts]: Start accepts. Automaton has 23605 states and 85588 transitions. Word has length 74 [2019-12-28 02:08:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:14,480 INFO L462 AbstractCegarLoop]: Abstraction has 23605 states and 85588 transitions. [2019-12-28 02:08:14,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:08:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23605 states and 85588 transitions. [2019-12-28 02:08:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 02:08:14,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:14,492 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] [2019-12-28 02:08:14,493 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 02:08:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 88006053, now seen corresponding path program 1 times [2019-12-28 02:08:14,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:14,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849096233] [2019-12-28 02:08:14,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:14,584 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 02:08:14,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849096233] [2019-12-28 02:08:14,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:14,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:08:14,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281735571] [2019-12-28 02:08:14,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:14,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:14,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 226 transitions. [2019-12-28 02:08:14,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:14,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:08:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:08:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:08:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:08:14,677 INFO L87 Difference]: Start difference. First operand 23605 states and 85588 transitions. Second operand 7 states. [2019-12-28 02:08:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:15,175 INFO L93 Difference]: Finished difference Result 30241 states and 108461 transitions. [2019-12-28 02:08:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:08:15,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-28 02:08:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:15,257 INFO L225 Difference]: With dead ends: 30241 [2019-12-28 02:08:15,257 INFO L226 Difference]: Without dead ends: 30061 [2019-12-28 02:08:15,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:08:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30061 states. [2019-12-28 02:08:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30061 to 26283. [2019-12-28 02:08:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26283 states. [2019-12-28 02:08:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26283 states to 26283 states and 94908 transitions. [2019-12-28 02:08:17,794 INFO L78 Accepts]: Start accepts. Automaton has 26283 states and 94908 transitions. Word has length 74 [2019-12-28 02:08:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:17,794 INFO L462 AbstractCegarLoop]: Abstraction has 26283 states and 94908 transitions. [2019-12-28 02:08:17,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:08:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 26283 states and 94908 transitions. [2019-12-28 02:08:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:17,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:17,813 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] [2019-12-28 02:08:17,813 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 02:08:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2116589149, now seen corresponding path program 1 times [2019-12-28 02:08:17,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:17,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369753575] [2019-12-28 02:08:17,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:17,867 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 02:08:17,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369753575] [2019-12-28 02:08:17,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:17,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:08:17,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826850268] [2019-12-28 02:08:17,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:17,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:17,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:17,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:17,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:17,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:08:17,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:08:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:08:17,906 INFO L87 Difference]: Start difference. First operand 26283 states and 94908 transitions. Second operand 4 states. [2019-12-28 02:08:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:18,279 INFO L93 Difference]: Finished difference Result 34917 states and 124769 transitions. [2019-12-28 02:08:18,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:08:18,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-28 02:08:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:18,346 INFO L225 Difference]: With dead ends: 34917 [2019-12-28 02:08:18,346 INFO L226 Difference]: Without dead ends: 34917 [2019-12-28 02:08:18,347 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 02:08:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34917 states. [2019-12-28 02:08:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34917 to 29736. [2019-12-28 02:08:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29736 states. [2019-12-28 02:08:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29736 states to 29736 states and 106661 transitions. [2019-12-28 02:08:18,874 INFO L78 Accepts]: Start accepts. Automaton has 29736 states and 106661 transitions. Word has length 78 [2019-12-28 02:08:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:18,874 INFO L462 AbstractCegarLoop]: Abstraction has 29736 states and 106661 transitions. [2019-12-28 02:08:18,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:08:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29736 states and 106661 transitions. [2019-12-28 02:08:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:18,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:18,899 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] [2019-12-28 02:08:18,900 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 02:08:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -933613666, now seen corresponding path program 1 times [2019-12-28 02:08:18,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:18,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20894644] [2019-12-28 02:08:18,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:19,312 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 02:08:19,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20894644] [2019-12-28 02:08:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:08:19,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676411092] [2019-12-28 02:08:19,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:19,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:19,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:19,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:19,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:08:19,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:08:19,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:08:19,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:08:19,372 INFO L87 Difference]: Start difference. First operand 29736 states and 106661 transitions. Second operand 6 states. [2019-12-28 02:08:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:20,039 INFO L93 Difference]: Finished difference Result 34481 states and 121690 transitions. [2019-12-28 02:08:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:08:20,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-12-28 02:08:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:20,104 INFO L225 Difference]: With dead ends: 34481 [2019-12-28 02:08:20,104 INFO L226 Difference]: Without dead ends: 34481 [2019-12-28 02:08:20,105 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 02:08:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34481 states. [2019-12-28 02:08:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34481 to 33416. [2019-12-28 02:08:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33416 states. [2019-12-28 02:08:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33416 states to 33416 states and 118239 transitions. [2019-12-28 02:08:20,694 INFO L78 Accepts]: Start accepts. Automaton has 33416 states and 118239 transitions. Word has length 78 [2019-12-28 02:08:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:20,694 INFO L462 AbstractCegarLoop]: Abstraction has 33416 states and 118239 transitions. [2019-12-28 02:08:20,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:08:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33416 states and 118239 transitions. [2019-12-28 02:08:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:20,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:20,720 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] [2019-12-28 02:08:20,720 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 02:08:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1284144287, now seen corresponding path program 1 times [2019-12-28 02:08:20,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:20,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017059744] [2019-12-28 02:08:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:08:20,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017059744] [2019-12-28 02:08:20,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:20,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:08:20,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134007990] [2019-12-28 02:08:20,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:20,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:20,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:20,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:20,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:20,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:08:20,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:08:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:08:20,871 INFO L87 Difference]: Start difference. First operand 33416 states and 118239 transitions. Second operand 6 states. [2019-12-28 02:08:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:21,845 INFO L93 Difference]: Finished difference Result 39884 states and 137567 transitions. [2019-12-28 02:08:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:08:21,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-12-28 02:08:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:21,950 INFO L225 Difference]: With dead ends: 39884 [2019-12-28 02:08:21,951 INFO L226 Difference]: Without dead ends: 39884 [2019-12-28 02:08:21,951 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 02:08:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39884 states. [2019-12-28 02:08:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39884 to 34244. [2019-12-28 02:08:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34244 states. [2019-12-28 02:08:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34244 states to 34244 states and 119105 transitions. [2019-12-28 02:08:22,557 INFO L78 Accepts]: Start accepts. Automaton has 34244 states and 119105 transitions. Word has length 78 [2019-12-28 02:08:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:22,557 INFO L462 AbstractCegarLoop]: Abstraction has 34244 states and 119105 transitions. [2019-12-28 02:08:22,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:08:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 34244 states and 119105 transitions. [2019-12-28 02:08:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:22,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:22,585 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] [2019-12-28 02:08:22,585 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 02:08:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1495495200, now seen corresponding path program 1 times [2019-12-28 02:08:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:22,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675912777] [2019-12-28 02:08:22,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:22,647 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 02:08:22,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675912777] [2019-12-28 02:08:22,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:22,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:08:22,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915570273] [2019-12-28 02:08:22,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:22,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:22,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:22,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:22,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:08:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:08:22,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:08:22,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:08:22,687 INFO L87 Difference]: Start difference. First operand 34244 states and 119105 transitions. Second operand 5 states. [2019-12-28 02:08:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:23,153 INFO L93 Difference]: Finished difference Result 41649 states and 144389 transitions. [2019-12-28 02:08:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:08:23,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-12-28 02:08:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:23,235 INFO L225 Difference]: With dead ends: 41649 [2019-12-28 02:08:23,236 INFO L226 Difference]: Without dead ends: 41649 [2019-12-28 02:08:23,236 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 02:08:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2019-12-28 02:08:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 36966. [2019-12-28 02:08:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36966 states. [2019-12-28 02:08:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36966 states to 36966 states and 127708 transitions. [2019-12-28 02:08:24,129 INFO L78 Accepts]: Start accepts. Automaton has 36966 states and 127708 transitions. Word has length 78 [2019-12-28 02:08:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:24,130 INFO L462 AbstractCegarLoop]: Abstraction has 36966 states and 127708 transitions. [2019-12-28 02:08:24,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:08:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36966 states and 127708 transitions. [2019-12-28 02:08:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:24,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:24,158 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] [2019-12-28 02:08:24,158 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 02:08:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 984961023, now seen corresponding path program 1 times [2019-12-28 02:08:24,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:24,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706700370] [2019-12-28 02:08:24,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:24,274 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 02:08:24,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706700370] [2019-12-28 02:08:24,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:24,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:08:24,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005758500] [2019-12-28 02:08:24,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:24,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:24,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:24,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:24,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:24,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:08:24,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:08:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:08:24,319 INFO L87 Difference]: Start difference. First operand 36966 states and 127708 transitions. Second operand 6 states. [2019-12-28 02:08:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:24,632 INFO L93 Difference]: Finished difference Result 38262 states and 129283 transitions. [2019-12-28 02:08:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:08:24,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-12-28 02:08:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:24,714 INFO L225 Difference]: With dead ends: 38262 [2019-12-28 02:08:24,714 INFO L226 Difference]: Without dead ends: 38262 [2019-12-28 02:08:24,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 02:08:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38262 states. [2019-12-28 02:08:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38262 to 32166. [2019-12-28 02:08:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32166 states. [2019-12-28 02:08:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32166 states to 32166 states and 109077 transitions. [2019-12-28 02:08:25,635 INFO L78 Accepts]: Start accepts. Automaton has 32166 states and 109077 transitions. Word has length 78 [2019-12-28 02:08:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:08:25,636 INFO L462 AbstractCegarLoop]: Abstraction has 32166 states and 109077 transitions. [2019-12-28 02:08:25,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:08:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32166 states and 109077 transitions. [2019-12-28 02:08:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 02:08:25,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:08:25,658 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] [2019-12-28 02:08:25,659 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 02:08:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:08:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash 75513345, now seen corresponding path program 1 times [2019-12-28 02:08:25,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:08:25,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820121389] [2019-12-28 02:08:25,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:08:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:08:25,733 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 02:08:25,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820121389] [2019-12-28 02:08:25,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:08:25,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:08:25,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384301309] [2019-12-28 02:08:25,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:08:25,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:08:25,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 98 transitions. [2019-12-28 02:08:25,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:08:25,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:08:25,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:08:25,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:08:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:08:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:08:25,771 INFO L87 Difference]: Start difference. First operand 32166 states and 109077 transitions. Second operand 6 states. [2019-12-28 02:08:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:08:25,907 INFO L93 Difference]: Finished difference Result 13185 states and 40470 transitions. [2019-12-28 02:08:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:08:25,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-12-28 02:08:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:08:25,934 INFO L225 Difference]: With dead ends: 13185 [2019-12-28 02:08:25,934 INFO L226 Difference]: Without dead ends: 11582 [2019-12-28 02:08:25,934 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 02:08:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11582 states. Received shutdown request... [2019-12-28 02:08:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11582 to 10866. [2019-12-28 02:08:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10866 states. [2019-12-28 02:08:26,144 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 02:08:26,152 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 02:08:26,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:08:26 BasicIcfg [2019-12-28 02:08:26,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:08:26,155 INFO L168 Benchmark]: Toolchain (without parser) took 184296.14 ms. Allocated memory was 144.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,162 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.74 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.0 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,167 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,168 INFO L168 Benchmark]: RCFGBuilder took 700.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.3 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,169 INFO L168 Benchmark]: TraceAbstraction took 182691.45 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 108.3 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 02:08:26,176 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.74 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.0 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 700.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.3 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182691.45 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 108.3 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.1 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 2 error locations. Result: TIMEOUT, OverallTime: 182.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 78.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5168 SDtfs, 7611 SDslu, 10800 SDs, 0 SdLazy, 4142 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232541occurred 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: 81.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 221363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1262 ConstructedInterpolants, 0 QuantifiedInterpolants, 209103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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