/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:23:59,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:23:59,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:23:59,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:23:59,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:23:59,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:23:59,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:23:59,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:23:59,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:23:59,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:23:59,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:23:59,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:23:59,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:23:59,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:24:00,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:24:00,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:24:00,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:24:00,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:24:00,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:24:00,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:24:00,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:24:00,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:24:00,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:24:00,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:24:00,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:24:00,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:24:00,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:24:00,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:24:00,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:24:00,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:24:00,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:24:00,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:24:00,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:24:00,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:24:00,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:24:00,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:24:00,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:24:00,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:24:00,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:24:00,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:24:00,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:24:00,026 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-SemanticLbe-MCR.epf [2019-12-27 15:24:00,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:24:00,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:24:00,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:24:00,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:24:00,041 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:24:00,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:24:00,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:24:00,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:24:00,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:24:00,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:24:00,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:24:00,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:24:00,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:24:00,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:24:00,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:24:00,043 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:24:00,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:24:00,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:24:00,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:24:00,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:24:00,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:24:00,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:24:00,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:24:00,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:24:00,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:24:00,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:24:00,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:24:00,046 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:24:00,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:24:00,046 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:24:00,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:24:00,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:24:00,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:24:00,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:24:00,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:24:00,333 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:24:00,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 15:24:00,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911372180/d35e206dbc704f9fb139729107e0808b/FLAGe39927013 [2019-12-27 15:24:00,884 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:24:00,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 15:24:00,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911372180/d35e206dbc704f9fb139729107e0808b/FLAGe39927013 [2019-12-27 15:24:01,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911372180/d35e206dbc704f9fb139729107e0808b [2019-12-27 15:24:01,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:24:01,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:24:01,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:24:01,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:24:01,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:24:01,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:01,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cdc2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01, skipping insertion in model container [2019-12-27 15:24:01,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:01,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:24:01,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:24:01,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:24:01,863 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:24:01,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:24:01,974 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:24:01,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01 WrapperNode [2019-12-27 15:24:01,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:24:01,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:24:01,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:24:01,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:24:01,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:24:02,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:24:02,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:24:02,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:24:02,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... [2019-12-27 15:24:02,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:24:02,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:24:02,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:24:02,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:24:02,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 15:24:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 15:24:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:24:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:24:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:24:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:24:02,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:24:02,118 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:24:02,452 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:24:02,453 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-27 15:24:02,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:24:02 BoogieIcfgContainer [2019-12-27 15:24:02,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:24:02,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:24:02,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:24:02,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:24:02,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:24:01" (1/3) ... [2019-12-27 15:24:02,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e434969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:24:02, skipping insertion in model container [2019-12-27 15:24:02,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:24:01" (2/3) ... [2019-12-27 15:24:02,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e434969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:24:02, skipping insertion in model container [2019-12-27 15:24:02,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:24:02" (3/3) ... [2019-12-27 15:24:02,462 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2019-12-27 15:24:02,473 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:24:02,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:24:02,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 15:24:02,480 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:24:02,501 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,502 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,502 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,505 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,506 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,512 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,512 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:02,532 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 15:24:02,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:02,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:02,553 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:02,553 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:02,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:02,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:02,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:02,554 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:02,566 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions [2019-12-27 15:24:02,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 15:24:02,603 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 15:24:02,603 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:24:02,608 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 15:24:02,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 15:24:02,624 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 15:24:02,624 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:24:02,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 15:24:02,627 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-27 15:24:02,628 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:03,300 INFO L206 etLargeBlockEncoding]: Checked pairs total: 160 [2019-12-27 15:24:03,300 INFO L214 etLargeBlockEncoding]: Total number of compositions: 29 [2019-12-27 15:24:03,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 8 transitions [2019-12-27 15:24:03,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2019-12-27 15:24:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-27 15:24:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:24:03,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:03,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:24:03,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash 4687879, now seen corresponding path program 1 times [2019-12-27 15:24:03,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:03,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397731181] [2019-12-27 15:24:03,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:03,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397731181] [2019-12-27 15:24:03,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:03,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:24:03,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300684107] [2019-12-27 15:24:03,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:03,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:03,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:24:03,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:03,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:03,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 15:24:03,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:03,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 15:24:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:24:03,613 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-12-27 15:24:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:03,618 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-12-27 15:24:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 15:24:03,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 15:24:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:03,640 INFO L225 Difference]: With dead ends: 11 [2019-12-27 15:24:03,640 INFO L226 Difference]: Without dead ends: 11 [2019-12-27 15:24:03,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:24:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-27 15:24:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-27 15:24:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-27 15:24:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-12-27 15:24:03,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2019-12-27 15:24:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:03,692 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-12-27 15:24:03,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 15:24:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-12-27 15:24:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 15:24:03,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:03,693 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-27 15:24:03,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2019-12-27 15:24:03,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:03,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904141032] [2019-12-27 15:24:03,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:03,749 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:03,750 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:03,751 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:03,751 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 15:24:03,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:03,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 15:24:03,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:03,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:03,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:03,772 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:03,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:03,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:03,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:03,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:03,776 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions [2019-12-27 15:24:03,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 15:24:03,808 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 15:24:03,808 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 15:24:03,813 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 15:24:03,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 15:24:03,843 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 15:24:03,843 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 15:24:03,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 15:24:03,846 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-27 15:24:03,847 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:04,589 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2019-12-27 15:24:04,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 35 [2019-12-27 15:24:04,589 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions [2019-12-27 15:24:04,595 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2019-12-27 15:24:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-27 15:24:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:24:04,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:04,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:24:04,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 238718261, now seen corresponding path program 1 times [2019-12-27 15:24:04,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:04,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880069034] [2019-12-27 15:24:04,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:04,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880069034] [2019-12-27 15:24:04,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:04,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:04,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557824832] [2019-12-27 15:24:04,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:04,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:04,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:24:04,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:04,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:04,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:04,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:04,641 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-27 15:24:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:04,679 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2019-12-27 15:24:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:04,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:24:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:04,684 INFO L225 Difference]: With dead ends: 96 [2019-12-27 15:24:04,684 INFO L226 Difference]: Without dead ends: 96 [2019-12-27 15:24:04,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-27 15:24:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-12-27 15:24:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 15:24:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2019-12-27 15:24:04,702 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2019-12-27 15:24:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:04,702 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2019-12-27 15:24:04,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2019-12-27 15:24:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:24:04,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:04,703 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:04,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -885466150, now seen corresponding path program 1 times [2019-12-27 15:24:04,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:04,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537858498] [2019-12-27 15:24:04,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:04,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537858498] [2019-12-27 15:24:04,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:04,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:04,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [702300107] [2019-12-27 15:24:04,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:04,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:04,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:24:04,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:04,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:04,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:04,746 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2019-12-27 15:24:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:04,765 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2019-12-27 15:24:04,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:04,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:24:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:04,767 INFO L225 Difference]: With dead ends: 84 [2019-12-27 15:24:04,767 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 15:24:04,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 15:24:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2019-12-27 15:24:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-27 15:24:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-27 15:24:04,780 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2019-12-27 15:24:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:04,781 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-27 15:24:04,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-27 15:24:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:04,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:04,782 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:04,782 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1678754413, now seen corresponding path program 1 times [2019-12-27 15:24:04,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:04,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054707442] [2019-12-27 15:24:04,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 15:24:04,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054707442] [2019-12-27 15:24:04,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:04,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:04,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907083194] [2019-12-27 15:24:04,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:04,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:04,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:04,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:04,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:24:04,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:04,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:04,842 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2019-12-27 15:24:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:04,887 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2019-12-27 15:24:04,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:04,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:04,890 INFO L225 Difference]: With dead ends: 68 [2019-12-27 15:24:04,890 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 15:24:04,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-27 15:24:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 15:24:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-27 15:24:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-27 15:24:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2019-12-27 15:24:04,899 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2019-12-27 15:24:04,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:04,899 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2019-12-27 15:24:04,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2019-12-27 15:24:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:04,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:04,900 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-27 15:24:04,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1679727603, now seen corresponding path program 1 times [2019-12-27 15:24:04,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:04,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046627756] [2019-12-27 15:24:04,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:04,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:04,929 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:04,929 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:04,929 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 15:24:04,936 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,936 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,936 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,936 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,936 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,938 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,953 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:04,956 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:24:04,956 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:04,957 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:04,957 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:04,957 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:04,957 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:04,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:04,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:04,957 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:04,959 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions [2019-12-27 15:24:04,960 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 15:24:04,975 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 15:24:04,975 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 15:24:04,977 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 15:24:04,980 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 15:24:04,994 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 15:24:04,995 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 15:24:04,996 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 15:24:04,999 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-27 15:24:04,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:05,791 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2078 [2019-12-27 15:24:05,791 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2019-12-27 15:24:05,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 17 transitions [2019-12-27 15:24:05,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2019-12-27 15:24:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2019-12-27 15:24:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:24:05,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:05,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:24:05,809 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:05,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 353939392, now seen corresponding path program 1 times [2019-12-27 15:24:05,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:05,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078928049] [2019-12-27 15:24:05,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:05,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078928049] [2019-12-27 15:24:05,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:05,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:05,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229833783] [2019-12-27 15:24:05,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:05,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:05,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:24:05,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:05,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:05,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:05,852 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2019-12-27 15:24:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:05,887 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2019-12-27 15:24:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:05,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:24:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:05,894 INFO L225 Difference]: With dead ends: 447 [2019-12-27 15:24:05,894 INFO L226 Difference]: Without dead ends: 447 [2019-12-27 15:24:05,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-27 15:24:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2019-12-27 15:24:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 15:24:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2019-12-27 15:24:05,952 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2019-12-27 15:24:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:05,952 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2019-12-27 15:24:05,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2019-12-27 15:24:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:24:05,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:05,953 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:05,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -36478308, now seen corresponding path program 1 times [2019-12-27 15:24:05,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:05,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287994931] [2019-12-27 15:24:05,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:05,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287994931] [2019-12-27 15:24:05,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:05,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:05,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777402076] [2019-12-27 15:24:05,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:05,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:05,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:24:05,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:05,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:05,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:05,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:05,983 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2019-12-27 15:24:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:06,027 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2019-12-27 15:24:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:06,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:24:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:06,034 INFO L225 Difference]: With dead ends: 486 [2019-12-27 15:24:06,034 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 15:24:06,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 15:24:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2019-12-27 15:24:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-27 15:24:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2019-12-27 15:24:06,057 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2019-12-27 15:24:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:06,057 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2019-12-27 15:24:06,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2019-12-27 15:24:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:06,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:06,058 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:06,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1917227077, now seen corresponding path program 1 times [2019-12-27 15:24:06,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:06,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269185740] [2019-12-27 15:24:06,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:06,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269185740] [2019-12-27 15:24:06,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:06,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:06,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91146276] [2019-12-27 15:24:06,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:06,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:06,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:06,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:06,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:06,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:06,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:06,097 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2019-12-27 15:24:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:06,125 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2019-12-27 15:24:06,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:06,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:06,128 INFO L225 Difference]: With dead ends: 338 [2019-12-27 15:24:06,128 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 15:24:06,129 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-27 15:24:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 15:24:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2019-12-27 15:24:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-27 15:24:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2019-12-27 15:24:06,140 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2019-12-27 15:24:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:06,141 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2019-12-27 15:24:06,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2019-12-27 15:24:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:06,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:06,142 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:06,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1130826520, now seen corresponding path program 1 times [2019-12-27 15:24:06,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:06,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797790363] [2019-12-27 15:24:06,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:06,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797790363] [2019-12-27 15:24:06,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:06,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117491570] [2019-12-27 15:24:06,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:06,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:06,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:06,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:06,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:06,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:06,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:06,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:06,175 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 4 states. [2019-12-27 15:24:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:06,200 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2019-12-27 15:24:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:06,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:06,203 INFO L225 Difference]: With dead ends: 233 [2019-12-27 15:24:06,203 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 15:24:06,204 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-27 15:24:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 15:24:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2019-12-27 15:24:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 15:24:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2019-12-27 15:24:06,211 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2019-12-27 15:24:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:06,211 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2019-12-27 15:24:06,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2019-12-27 15:24:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:24:06,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:06,213 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:06,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:06,213 INFO L82 PathProgramCache]: Analyzing trace with hash -197280631, now seen corresponding path program 1 times [2019-12-27 15:24:06,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:06,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772900225] [2019-12-27 15:24:06,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:06,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772900225] [2019-12-27 15:24:06,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:06,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:06,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988457379] [2019-12-27 15:24:06,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:06,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:06,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:24:06,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:06,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:06,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:06,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:06,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:06,239 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2019-12-27 15:24:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:06,264 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2019-12-27 15:24:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:06,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:24:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:06,266 INFO L225 Difference]: With dead ends: 243 [2019-12-27 15:24:06,266 INFO L226 Difference]: Without dead ends: 243 [2019-12-27 15:24:06,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-27 15:24:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2019-12-27 15:24:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-27 15:24:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2019-12-27 15:24:06,274 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2019-12-27 15:24:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:06,275 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2019-12-27 15:24:06,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2019-12-27 15:24:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:24:06,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:06,277 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:06,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1820731179, now seen corresponding path program 1 times [2019-12-27 15:24:06,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:06,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648123190] [2019-12-27 15:24:06,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:06,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648123190] [2019-12-27 15:24:06,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:06,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:06,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35490008] [2019-12-27 15:24:06,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:06,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:06,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 15:24:06,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:06,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:06,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:06,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:06,327 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 4 states. [2019-12-27 15:24:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:06,348 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2019-12-27 15:24:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:06,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 15:24:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:06,350 INFO L225 Difference]: With dead ends: 179 [2019-12-27 15:24:06,350 INFO L226 Difference]: Without dead ends: 179 [2019-12-27 15:24:06,351 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-27 15:24:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-27 15:24:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2019-12-27 15:24:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-27 15:24:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2019-12-27 15:24:06,356 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2019-12-27 15:24:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:06,357 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2019-12-27 15:24:06,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2019-12-27 15:24:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:24:06,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:06,358 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-27 15:24:06,358 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1820837778, now seen corresponding path program 1 times [2019-12-27 15:24:06,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:06,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984040053] [2019-12-27 15:24:06,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:06,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:06,380 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:06,381 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:06,381 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 15:24:06,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:06,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:24:06,408 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:06,408 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:06,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:06,408 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:06,409 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:06,409 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:06,409 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:06,409 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:06,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions [2019-12-27 15:24:06,411 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 15:24:06,429 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 15:24:06,430 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 15:24:06,432 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 15:24:06,437 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 15:24:06,461 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 15:24:06,461 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 15:24:06,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 15:24:06,479 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 15:24:06,479 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:07,361 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3457 [2019-12-27 15:24:07,362 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 15:24:07,363 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions [2019-12-27 15:24:07,479 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2020 states. [2019-12-27 15:24:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states. [2019-12-27 15:24:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:24:07,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:07,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:24:07,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:07,483 INFO L82 PathProgramCache]: Analyzing trace with hash 491318823, now seen corresponding path program 1 times [2019-12-27 15:24:07,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917312322] [2019-12-27 15:24:07,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:07,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917312322] [2019-12-27 15:24:07,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:07,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:07,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730192677] [2019-12-27 15:24:07,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:07,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:07,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:24:07,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:07,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:07,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:07,520 INFO L87 Difference]: Start difference. First operand 2020 states. Second operand 3 states. [2019-12-27 15:24:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:07,621 INFO L93 Difference]: Finished difference Result 2352 states and 8424 transitions. [2019-12-27 15:24:07,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:07,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:24:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:07,642 INFO L225 Difference]: With dead ends: 2352 [2019-12-27 15:24:07,642 INFO L226 Difference]: Without dead ends: 2352 [2019-12-27 15:24:07,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-12-27 15:24:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1967. [2019-12-27 15:24:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 15:24:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7298 transitions. [2019-12-27 15:24:07,742 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7298 transitions. Word has length 5 [2019-12-27 15:24:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:07,742 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7298 transitions. [2019-12-27 15:24:07,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7298 transitions. [2019-12-27 15:24:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:24:07,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:07,744 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:07,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash -487037178, now seen corresponding path program 1 times [2019-12-27 15:24:07,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:07,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928779972] [2019-12-27 15:24:07,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:07,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928779972] [2019-12-27 15:24:07,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951587067] [2019-12-27 15:24:07,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:07,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:07,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:24:07,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:07,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:07,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:07,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:07,784 INFO L87 Difference]: Start difference. First operand 1967 states and 7298 transitions. Second operand 3 states. [2019-12-27 15:24:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:07,850 INFO L93 Difference]: Finished difference Result 2953 states and 10780 transitions. [2019-12-27 15:24:07,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:07,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:24:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:07,877 INFO L225 Difference]: With dead ends: 2953 [2019-12-27 15:24:07,877 INFO L226 Difference]: Without dead ends: 2953 [2019-12-27 15:24:07,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-12-27 15:24:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2223. [2019-12-27 15:24:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-27 15:24:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 8283 transitions. [2019-12-27 15:24:07,982 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 8283 transitions. Word has length 8 [2019-12-27 15:24:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:07,982 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 8283 transitions. [2019-12-27 15:24:07,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 8283 transitions. [2019-12-27 15:24:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:07,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:07,983 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:07,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:07,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1358722116, now seen corresponding path program 1 times [2019-12-27 15:24:07,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:07,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919554944] [2019-12-27 15:24:07,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919554944] [2019-12-27 15:24:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:08,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392414466] [2019-12-27 15:24:08,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:08,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:08,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:08,026 INFO L87 Difference]: Start difference. First operand 2223 states and 8283 transitions. Second operand 4 states. [2019-12-27 15:24:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,073 INFO L93 Difference]: Finished difference Result 1779 states and 6526 transitions. [2019-12-27 15:24:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,088 INFO L225 Difference]: With dead ends: 1779 [2019-12-27 15:24:08,089 INFO L226 Difference]: Without dead ends: 1779 [2019-12-27 15:24:08,089 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-27 15:24:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-27 15:24:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1414. [2019-12-27 15:24:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-27 15:24:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 5095 transitions. [2019-12-27 15:24:08,148 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 5095 transitions. Word has length 9 [2019-12-27 15:24:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,148 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 5095 transitions. [2019-12-27 15:24:08,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 5095 transitions. [2019-12-27 15:24:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:08,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,149 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2081718434, now seen corresponding path program 1 times [2019-12-27 15:24:08,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404021656] [2019-12-27 15:24:08,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:08,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404021656] [2019-12-27 15:24:08,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:08,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163262776] [2019-12-27 15:24:08,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:08,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:08,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:08,202 INFO L87 Difference]: Start difference. First operand 1414 states and 5095 transitions. Second operand 4 states. [2019-12-27 15:24:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,258 INFO L93 Difference]: Finished difference Result 1187 states and 4236 transitions. [2019-12-27 15:24:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,272 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 15:24:08,272 INFO L226 Difference]: Without dead ends: 1187 [2019-12-27 15:24:08,273 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-27 15:24:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-27 15:24:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 960. [2019-12-27 15:24:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 15:24:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 3377 transitions. [2019-12-27 15:24:08,322 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 3377 transitions. Word has length 9 [2019-12-27 15:24:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,322 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 3377 transitions. [2019-12-27 15:24:08,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 3377 transitions. [2019-12-27 15:24:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:24:08,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,323 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,323 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1050664949, now seen corresponding path program 1 times [2019-12-27 15:24:08,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386245781] [2019-12-27 15:24:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:08,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386245781] [2019-12-27 15:24:08,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:08,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1647433853] [2019-12-27 15:24:08,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:24:08,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:08,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:08,383 INFO L87 Difference]: Start difference. First operand 960 states and 3377 transitions. Second operand 3 states. [2019-12-27 15:24:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,426 INFO L93 Difference]: Finished difference Result 1395 states and 4813 transitions. [2019-12-27 15:24:08,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:24:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,439 INFO L225 Difference]: With dead ends: 1395 [2019-12-27 15:24:08,439 INFO L226 Difference]: Without dead ends: 1395 [2019-12-27 15:24:08,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-27 15:24:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1174. [2019-12-27 15:24:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-27 15:24:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4190 transitions. [2019-12-27 15:24:08,486 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4190 transitions. Word has length 11 [2019-12-27 15:24:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,487 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 4190 transitions. [2019-12-27 15:24:08,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4190 transitions. [2019-12-27 15:24:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:24:08,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,488 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1789126636, now seen corresponding path program 1 times [2019-12-27 15:24:08,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182139236] [2019-12-27 15:24:08,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:08,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182139236] [2019-12-27 15:24:08,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:08,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950179352] [2019-12-27 15:24:08,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 15:24:08,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:08,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:08,524 INFO L87 Difference]: Start difference. First operand 1174 states and 4190 transitions. Second operand 4 states. [2019-12-27 15:24:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,558 INFO L93 Difference]: Finished difference Result 953 states and 3346 transitions. [2019-12-27 15:24:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 15:24:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,566 INFO L225 Difference]: With dead ends: 953 [2019-12-27 15:24:08,566 INFO L226 Difference]: Without dead ends: 953 [2019-12-27 15:24:08,567 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-27 15:24:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-27 15:24:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 732. [2019-12-27 15:24:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-12-27 15:24:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2502 transitions. [2019-12-27 15:24:08,592 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2502 transitions. Word has length 12 [2019-12-27 15:24:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,592 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 2502 transitions. [2019-12-27 15:24:08,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2502 transitions. [2019-12-27 15:24:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:24:08,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,594 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1243568347, now seen corresponding path program 1 times [2019-12-27 15:24:08,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035906150] [2019-12-27 15:24:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:08,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035906150] [2019-12-27 15:24:08,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:08,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337364999] [2019-12-27 15:24:08,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:24:08,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:08,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:08,613 INFO L87 Difference]: Start difference. First operand 732 states and 2502 transitions. Second operand 3 states. [2019-12-27 15:24:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,640 INFO L93 Difference]: Finished difference Result 1008 states and 3409 transitions. [2019-12-27 15:24:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 15:24:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,647 INFO L225 Difference]: With dead ends: 1008 [2019-12-27 15:24:08,648 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 15:24:08,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 15:24:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 868. [2019-12-27 15:24:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-27 15:24:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 3016 transitions. [2019-12-27 15:24:08,675 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 3016 transitions. Word has length 14 [2019-12-27 15:24:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,675 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 3016 transitions. [2019-12-27 15:24:08,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 3016 transitions. [2019-12-27 15:24:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:24:08,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,677 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,677 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash -104085370, now seen corresponding path program 1 times [2019-12-27 15:24:08,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45391530] [2019-12-27 15:24:08,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:08,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45391530] [2019-12-27 15:24:08,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:08,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:08,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484867823] [2019-12-27 15:24:08,699 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:08,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:08,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 15:24:08,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:08,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:08,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:08,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:08,704 INFO L87 Difference]: Start difference. First operand 868 states and 3016 transitions. Second operand 4 states. [2019-12-27 15:24:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:08,735 INFO L93 Difference]: Finished difference Result 728 states and 2483 transitions. [2019-12-27 15:24:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 15:24:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:08,740 INFO L225 Difference]: With dead ends: 728 [2019-12-27 15:24:08,740 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 15:24:08,740 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-27 15:24:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 15:24:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 588. [2019-12-27 15:24:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 15:24:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1950 transitions. [2019-12-27 15:24:08,759 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1950 transitions. Word has length 15 [2019-12-27 15:24:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:08,759 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1950 transitions. [2019-12-27 15:24:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1950 transitions. [2019-12-27 15:24:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:24:08,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:08,761 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:08,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 15:24:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash -104215289, now seen corresponding path program 1 times [2019-12-27 15:24:08,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:08,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581943164] [2019-12-27 15:24:08,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:08,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:08,780 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:08,780 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:08,780 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 15:24:08,788 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,788 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,788 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:08,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 15:24:08,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:08,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:08,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:08,811 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:08,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:08,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:08,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:08,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:08,812 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions [2019-12-27 15:24:08,812 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 15:24:08,833 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 15:24:08,833 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 15:24:08,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 15:24:08,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 15:24:08,861 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 15:24:08,861 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 15:24:08,863 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 15:24:08,871 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-27 15:24:08,871 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:09,966 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5838 [2019-12-27 15:24:09,966 INFO L214 etLargeBlockEncoding]: Total number of compositions: 65 [2019-12-27 15:24:09,966 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 25 transitions [2019-12-27 15:24:10,373 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2019-12-27 15:24:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2019-12-27 15:24:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:24:10,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:10,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:24:10,374 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash 652705188, now seen corresponding path program 1 times [2019-12-27 15:24:10,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:10,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55444884] [2019-12-27 15:24:10,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:10,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55444884] [2019-12-27 15:24:10,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:10,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:10,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [645963052] [2019-12-27 15:24:10,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:10,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:10,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:24:10,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:10,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:10,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:10,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:10,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:10,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:10,393 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2019-12-27 15:24:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:10,546 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2019-12-27 15:24:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:10,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:24:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:10,598 INFO L225 Difference]: With dead ends: 7629 [2019-12-27 15:24:10,598 INFO L226 Difference]: Without dead ends: 7629 [2019-12-27 15:24:10,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2019-12-27 15:24:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2019-12-27 15:24:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2019-12-27 15:24:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2019-12-27 15:24:10,932 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2019-12-27 15:24:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:10,932 INFO L462 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2019-12-27 15:24:10,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2019-12-27 15:24:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:24:10,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:10,934 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:10,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1277107584, now seen corresponding path program 1 times [2019-12-27 15:24:10,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:10,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646037910] [2019-12-27 15:24:10,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:10,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646037910] [2019-12-27 15:24:10,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:10,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:10,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186203237] [2019-12-27 15:24:10,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:10,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:10,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:24:10,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:10,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:10,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:10,968 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2019-12-27 15:24:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:11,086 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2019-12-27 15:24:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:11,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:24:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:11,135 INFO L225 Difference]: With dead ends: 9120 [2019-12-27 15:24:11,135 INFO L226 Difference]: Without dead ends: 9120 [2019-12-27 15:24:11,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2019-12-27 15:24:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2019-12-27 15:24:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-12-27 15:24:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2019-12-27 15:24:11,578 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2019-12-27 15:24:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:11,578 INFO L462 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2019-12-27 15:24:11,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2019-12-27 15:24:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:11,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:11,579 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:11,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 935631175, now seen corresponding path program 1 times [2019-12-27 15:24:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:11,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976699780] [2019-12-27 15:24:11,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:11,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976699780] [2019-12-27 15:24:11,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:11,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:11,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271904420] [2019-12-27 15:24:11,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:11,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:11,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:11,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:11,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:11,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:11,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:11,601 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2019-12-27 15:24:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:11,686 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2019-12-27 15:24:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:11,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:11,714 INFO L225 Difference]: With dead ends: 6008 [2019-12-27 15:24:11,714 INFO L226 Difference]: Without dead ends: 6008 [2019-12-27 15:24:11,715 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-27 15:24:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2019-12-27 15:24:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2019-12-27 15:24:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-12-27 15:24:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2019-12-27 15:24:12,420 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2019-12-27 15:24:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:12,421 INFO L462 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2019-12-27 15:24:12,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2019-12-27 15:24:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:12,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:12,422 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:12,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 935633007, now seen corresponding path program 1 times [2019-12-27 15:24:12,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:12,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748823541] [2019-12-27 15:24:12,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748823541] [2019-12-27 15:24:12,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:12,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:12,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870704759] [2019-12-27 15:24:12,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:12,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:12,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:12,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:12,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:24:12,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:12,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:12,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:12,448 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 4 states. [2019-12-27 15:24:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:12,541 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2019-12-27 15:24:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:12,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:12,564 INFO L225 Difference]: With dead ends: 3827 [2019-12-27 15:24:12,565 INFO L226 Difference]: Without dead ends: 3827 [2019-12-27 15:24:12,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-27 15:24:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-27 15:24:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2019-12-27 15:24:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-12-27 15:24:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2019-12-27 15:24:12,697 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2019-12-27 15:24:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:12,697 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2019-12-27 15:24:12,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2019-12-27 15:24:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:24:12,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:12,699 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:12,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1346541726, now seen corresponding path program 1 times [2019-12-27 15:24:12,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:12,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488862744] [2019-12-27 15:24:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:12,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488862744] [2019-12-27 15:24:12,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:12,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:12,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368073173] [2019-12-27 15:24:12,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:12,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:12,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:24:12,743 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:12,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:12,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:12,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:12,744 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2019-12-27 15:24:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:12,803 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2019-12-27 15:24:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:12,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:24:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:12,822 INFO L225 Difference]: With dead ends: 4275 [2019-12-27 15:24:12,823 INFO L226 Difference]: Without dead ends: 4275 [2019-12-27 15:24:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-27 15:24:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2019-12-27 15:24:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-12-27 15:24:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2019-12-27 15:24:12,941 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2019-12-27 15:24:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:12,941 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2019-12-27 15:24:12,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2019-12-27 15:24:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:24:12,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:12,943 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:12,943 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1206877661, now seen corresponding path program 1 times [2019-12-27 15:24:12,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:12,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022257062] [2019-12-27 15:24:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:12,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022257062] [2019-12-27 15:24:12,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:12,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:12,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017058336] [2019-12-27 15:24:12,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:12,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:12,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 15:24:12,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:12,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:12,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:12,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:12,971 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 4 states. [2019-12-27 15:24:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:13,025 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2019-12-27 15:24:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 15:24:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:13,039 INFO L225 Difference]: With dead ends: 2873 [2019-12-27 15:24:13,039 INFO L226 Difference]: Without dead ends: 2873 [2019-12-27 15:24:13,040 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-27 15:24:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-12-27 15:24:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2019-12-27 15:24:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-12-27 15:24:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2019-12-27 15:24:13,209 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2019-12-27 15:24:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:13,209 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2019-12-27 15:24:13,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2019-12-27 15:24:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:24:13,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:13,210 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:13,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash -315974263, now seen corresponding path program 1 times [2019-12-27 15:24:13,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:13,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792104743] [2019-12-27 15:24:13,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:13,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792104743] [2019-12-27 15:24:13,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:13,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:13,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331881840] [2019-12-27 15:24:13,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:13,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:13,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:24:13,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:13,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:13,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:13,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:13,231 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2019-12-27 15:24:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:13,288 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2019-12-27 15:24:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:13,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 15:24:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:13,308 INFO L225 Difference]: With dead ends: 3177 [2019-12-27 15:24:13,308 INFO L226 Difference]: Without dead ends: 3177 [2019-12-27 15:24:13,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2019-12-27 15:24:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2019-12-27 15:24:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-27 15:24:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2019-12-27 15:24:13,412 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2019-12-27 15:24:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:13,414 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2019-12-27 15:24:13,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2019-12-27 15:24:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:24:13,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:13,416 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:13,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1205265918, now seen corresponding path program 1 times [2019-12-27 15:24:13,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:13,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554195471] [2019-12-27 15:24:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:13,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554195471] [2019-12-27 15:24:13,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146841216] [2019-12-27 15:24:13,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:13,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:13,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 15:24:13,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:13,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:13,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:13,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:13,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:13,462 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 4 states. [2019-12-27 15:24:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:13,524 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2019-12-27 15:24:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:13,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 15:24:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:13,537 INFO L225 Difference]: With dead ends: 2165 [2019-12-27 15:24:13,537 INFO L226 Difference]: Without dead ends: 2165 [2019-12-27 15:24:13,538 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-27 15:24:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-12-27 15:24:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2019-12-27 15:24:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-27 15:24:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2019-12-27 15:24:13,584 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2019-12-27 15:24:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:13,584 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2019-12-27 15:24:13,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2019-12-27 15:24:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:24:13,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:13,586 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:13,586 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1240295411, now seen corresponding path program 1 times [2019-12-27 15:24:13,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:13,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829282903] [2019-12-27 15:24:13,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 15:24:13,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829282903] [2019-12-27 15:24:13,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:13,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:13,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959466375] [2019-12-27 15:24:13,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:13,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:13,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:24:13,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:13,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:13,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:13,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:13,617 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2019-12-27 15:24:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:13,659 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2019-12-27 15:24:13,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:13,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 15:24:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:13,668 INFO L225 Difference]: With dead ends: 2295 [2019-12-27 15:24:13,668 INFO L226 Difference]: Without dead ends: 2295 [2019-12-27 15:24:13,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-12-27 15:24:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2019-12-27 15:24:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 15:24:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2019-12-27 15:24:13,721 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2019-12-27 15:24:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:13,721 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2019-12-27 15:24:13,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2019-12-27 15:24:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:24:13,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:13,723 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:13,724 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -205702466, now seen corresponding path program 1 times [2019-12-27 15:24:13,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:13,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356721076] [2019-12-27 15:24:13,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:13,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:13,751 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:13,751 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:13,752 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 15:24:13,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,770 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,772 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,773 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,773 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,777 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,785 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,785 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,788 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,788 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,790 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,790 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,790 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:13,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 15:24:13,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:13,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:13,794 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:13,794 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:13,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:13,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:13,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:13,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:13,795 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions [2019-12-27 15:24:13,796 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 15:24:13,823 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 15:24:13,823 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 15:24:13,827 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 15:24:13,841 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 15:24:13,871 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 15:24:13,871 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 15:24:13,877 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 15:24:13,890 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-27 15:24:13,890 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:15,052 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8316 [2019-12-27 15:24:15,053 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2019-12-27 15:24:15,053 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 31 transitions [2019-12-27 15:24:18,494 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32404 states. [2019-12-27 15:24:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 32404 states. [2019-12-27 15:24:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:24:18,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:18,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:24:18,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 837410524, now seen corresponding path program 1 times [2019-12-27 15:24:18,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:18,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071176671] [2019-12-27 15:24:18,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:18,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071176671] [2019-12-27 15:24:18,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:18,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:18,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914381017] [2019-12-27 15:24:18,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:18,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:18,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:24:18,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:18,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:18,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:18,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:18,524 INFO L87 Difference]: Start difference. First operand 32404 states. Second operand 3 states. [2019-12-27 15:24:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:19,815 INFO L93 Difference]: Finished difference Result 38316 states and 194259 transitions. [2019-12-27 15:24:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:19,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:24:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:19,941 INFO L225 Difference]: With dead ends: 38316 [2019-12-27 15:24:19,941 INFO L226 Difference]: Without dead ends: 38316 [2019-12-27 15:24:19,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38316 states. [2019-12-27 15:24:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38316 to 31940. [2019-12-27 15:24:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31940 states. [2019-12-27 15:24:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31940 states to 31940 states and 166174 transitions. [2019-12-27 15:24:21,846 INFO L78 Accepts]: Start accepts. Automaton has 31940 states and 166174 transitions. Word has length 5 [2019-12-27 15:24:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:21,846 INFO L462 AbstractCegarLoop]: Abstraction has 31940 states and 166174 transitions. [2019-12-27 15:24:21,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31940 states and 166174 transitions. [2019-12-27 15:24:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:24:21,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:21,847 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:21,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1966218909, now seen corresponding path program 1 times [2019-12-27 15:24:21,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:21,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922222696] [2019-12-27 15:24:21,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:21,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922222696] [2019-12-27 15:24:21,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:21,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:21,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190305786] [2019-12-27 15:24:21,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:21,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:21,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:24:21,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:21,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:21,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:21,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:21,869 INFO L87 Difference]: Start difference. First operand 31940 states and 166174 transitions. Second operand 3 states. [2019-12-27 15:24:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:22,182 INFO L93 Difference]: Finished difference Result 46178 states and 235622 transitions. [2019-12-27 15:24:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:22,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:24:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:22,343 INFO L225 Difference]: With dead ends: 46178 [2019-12-27 15:24:22,343 INFO L226 Difference]: Without dead ends: 46178 [2019-12-27 15:24:22,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46178 states. [2019-12-27 15:24:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46178 to 38236. [2019-12-27 15:24:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38236 states. [2019-12-27 15:24:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38236 states to 38236 states and 200230 transitions. [2019-12-27 15:24:26,085 INFO L78 Accepts]: Start accepts. Automaton has 38236 states and 200230 transitions. Word has length 8 [2019-12-27 15:24:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:26,085 INFO L462 AbstractCegarLoop]: Abstraction has 38236 states and 200230 transitions. [2019-12-27 15:24:26,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 38236 states and 200230 transitions. [2019-12-27 15:24:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:26,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:26,085 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:26,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1411123806, now seen corresponding path program 1 times [2019-12-27 15:24:26,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:26,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932681414] [2019-12-27 15:24:26,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:24:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932681414] [2019-12-27 15:24:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [948001062] [2019-12-27 15:24:26,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:26,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:26,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:26,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:26,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:26,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:26,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:26,120 INFO L87 Difference]: Start difference. First operand 38236 states and 200230 transitions. Second operand 4 states. [2019-12-27 15:24:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:26,363 INFO L93 Difference]: Finished difference Result 30294 states and 156896 transitions. [2019-12-27 15:24:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:26,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:26,457 INFO L225 Difference]: With dead ends: 30294 [2019-12-27 15:24:26,458 INFO L226 Difference]: Without dead ends: 30294 [2019-12-27 15:24:26,458 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-27 15:24:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30294 states. [2019-12-27 15:24:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30294 to 23950. [2019-12-27 15:24:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23950 states. [2019-12-27 15:24:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23950 states to 23950 states and 122597 transitions. [2019-12-27 15:24:29,218 INFO L78 Accepts]: Start accepts. Automaton has 23950 states and 122597 transitions. Word has length 9 [2019-12-27 15:24:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:29,218 INFO L462 AbstractCegarLoop]: Abstraction has 23950 states and 122597 transitions. [2019-12-27 15:24:29,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23950 states and 122597 transitions. [2019-12-27 15:24:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:24:29,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:29,218 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:29,219 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash 823246975, now seen corresponding path program 1 times [2019-12-27 15:24:29,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:29,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384377080] [2019-12-27 15:24:29,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:24:29,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384377080] [2019-12-27 15:24:29,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:29,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:29,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328971828] [2019-12-27 15:24:29,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:29,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:29,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:24:29,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:29,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:29,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:29,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:29,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:29,240 INFO L87 Difference]: Start difference. First operand 23950 states and 122597 transitions. Second operand 4 states. [2019-12-27 15:24:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:29,420 INFO L93 Difference]: Finished difference Result 19172 states and 97171 transitions. [2019-12-27 15:24:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:29,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:24:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:29,474 INFO L225 Difference]: With dead ends: 19172 [2019-12-27 15:24:29,474 INFO L226 Difference]: Without dead ends: 19172 [2019-12-27 15:24:29,474 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-27 15:24:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19172 states. [2019-12-27 15:24:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19172 to 14394. [2019-12-27 15:24:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-12-27 15:24:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 71745 transitions. [2019-12-27 15:24:30,243 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 71745 transitions. Word has length 9 [2019-12-27 15:24:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:30,243 INFO L462 AbstractCegarLoop]: Abstraction has 14394 states and 71745 transitions. [2019-12-27 15:24:30,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 71745 transitions. [2019-12-27 15:24:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:24:30,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:30,244 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:30,244 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash 697229360, now seen corresponding path program 1 times [2019-12-27 15:24:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:30,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366910571] [2019-12-27 15:24:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366910571] [2019-12-27 15:24:30,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:30,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:30,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1773298621] [2019-12-27 15:24:30,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:30,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:30,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:24:30,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:30,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:30,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:30,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:30,271 INFO L87 Difference]: Start difference. First operand 14394 states and 71745 transitions. Second operand 3 states. [2019-12-27 15:24:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:30,525 INFO L93 Difference]: Finished difference Result 22955 states and 113320 transitions. [2019-12-27 15:24:30,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:30,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:24:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:30,639 INFO L225 Difference]: With dead ends: 22955 [2019-12-27 15:24:30,639 INFO L226 Difference]: Without dead ends: 22955 [2019-12-27 15:24:30,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22955 states. [2019-12-27 15:24:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22955 to 17239. [2019-12-27 15:24:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17239 states. [2019-12-27 15:24:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17239 states to 17239 states and 86508 transitions. [2019-12-27 15:24:31,305 INFO L78 Accepts]: Start accepts. Automaton has 17239 states and 86508 transitions. Word has length 11 [2019-12-27 15:24:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:31,305 INFO L462 AbstractCegarLoop]: Abstraction has 17239 states and 86508 transitions. [2019-12-27 15:24:31,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17239 states and 86508 transitions. [2019-12-27 15:24:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:24:31,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:31,306 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:31,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash 139276080, now seen corresponding path program 1 times [2019-12-27 15:24:31,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:31,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353672404] [2019-12-27 15:24:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:24:31,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353672404] [2019-12-27 15:24:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:31,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:31,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368212640] [2019-12-27 15:24:31,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:31,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:31,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 15:24:31,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:31,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:31,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:31,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:31,341 INFO L87 Difference]: Start difference. First operand 17239 states and 86508 transitions. Second operand 4 states. [2019-12-27 15:24:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:31,493 INFO L93 Difference]: Finished difference Result 14381 states and 71673 transitions. [2019-12-27 15:24:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:31,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 15:24:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:31,540 INFO L225 Difference]: With dead ends: 14381 [2019-12-27 15:24:31,541 INFO L226 Difference]: Without dead ends: 14381 [2019-12-27 15:24:31,541 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-27 15:24:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14381 states. [2019-12-27 15:24:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14381 to 11523. [2019-12-27 15:24:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2019-12-27 15:24:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2019-12-27 15:24:32,961 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 12 [2019-12-27 15:24:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:32,961 INFO L462 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2019-12-27 15:24:32,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2019-12-27 15:24:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:24:32,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:32,962 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:32,962 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 533949827, now seen corresponding path program 1 times [2019-12-27 15:24:32,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:32,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226709150] [2019-12-27 15:24:32,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:32,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226709150] [2019-12-27 15:24:32,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:32,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:32,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197461664] [2019-12-27 15:24:32,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:32,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:32,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 15:24:32,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:32,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:32,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:32,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:32,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:32,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:32,982 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2019-12-27 15:24:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:33,113 INFO L93 Difference]: Finished difference Result 17181 states and 83458 transitions. [2019-12-27 15:24:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:33,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 15:24:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:33,158 INFO L225 Difference]: With dead ends: 17181 [2019-12-27 15:24:33,158 INFO L226 Difference]: Without dead ends: 17181 [2019-12-27 15:24:33,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17181 states. [2019-12-27 15:24:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17181 to 14347. [2019-12-27 15:24:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-27 15:24:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 71535 transitions. [2019-12-27 15:24:33,565 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 71535 transitions. Word has length 14 [2019-12-27 15:24:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:33,565 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 71535 transitions. [2019-12-27 15:24:33,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 71535 transitions. [2019-12-27 15:24:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:24:33,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:33,567 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:33,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash -627421727, now seen corresponding path program 1 times [2019-12-27 15:24:33,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:33,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073390241] [2019-12-27 15:24:33,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 15:24:33,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073390241] [2019-12-27 15:24:33,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:33,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:33,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050873776] [2019-12-27 15:24:33,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:33,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:33,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 34 transitions. [2019-12-27 15:24:33,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:33,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:33,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:33,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:33,602 INFO L87 Difference]: Start difference. First operand 14347 states and 71535 transitions. Second operand 4 states. [2019-12-27 15:24:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:33,741 INFO L93 Difference]: Finished difference Result 11513 states and 56778 transitions. [2019-12-27 15:24:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:33,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 15:24:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:33,787 INFO L225 Difference]: With dead ends: 11513 [2019-12-27 15:24:33,788 INFO L226 Difference]: Without dead ends: 11513 [2019-12-27 15:24:33,789 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-27 15:24:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-27 15:24:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 8679. [2019-12-27 15:24:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-12-27 15:24:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 42021 transitions. [2019-12-27 15:24:34,033 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 42021 transitions. Word has length 15 [2019-12-27 15:24:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:34,033 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 42021 transitions. [2019-12-27 15:24:34,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 42021 transitions. [2019-12-27 15:24:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:24:34,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:34,034 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:34,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1825068028, now seen corresponding path program 1 times [2019-12-27 15:24:34,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:34,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080205691] [2019-12-27 15:24:34,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 15:24:34,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080205691] [2019-12-27 15:24:34,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:34,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:34,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574352824] [2019-12-27 15:24:34,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:34,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:34,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:24:34,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:34,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:34,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:34,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:34,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:34,052 INFO L87 Difference]: Start difference. First operand 8679 states and 42021 transitions. Second operand 3 states. [2019-12-27 15:24:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:34,167 INFO L93 Difference]: Finished difference Result 12762 states and 61063 transitions. [2019-12-27 15:24:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:34,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 15:24:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:34,216 INFO L225 Difference]: With dead ends: 12762 [2019-12-27 15:24:34,216 INFO L226 Difference]: Without dead ends: 12762 [2019-12-27 15:24:34,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-27 15:24:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 10717. [2019-12-27 15:24:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-27 15:24:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 52542 transitions. [2019-12-27 15:24:34,655 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 52542 transitions. Word has length 17 [2019-12-27 15:24:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:34,656 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 52542 transitions. [2019-12-27 15:24:34,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 52542 transitions. [2019-12-27 15:24:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:24:34,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:34,657 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:34,657 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash -742531920, now seen corresponding path program 1 times [2019-12-27 15:24:34,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:34,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882449302] [2019-12-27 15:24:34,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 15:24:34,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882449302] [2019-12-27 15:24:34,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:34,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:24:34,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904532421] [2019-12-27 15:24:34,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:34,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:34,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 43 transitions. [2019-12-27 15:24:34,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:34,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:34,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:24:34,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:24:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:24:34,700 INFO L87 Difference]: Start difference. First operand 10717 states and 52542 transitions. Second operand 4 states. [2019-12-27 15:24:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:34,785 INFO L93 Difference]: Finished difference Result 8672 states and 41976 transitions. [2019-12-27 15:24:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:34,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 15:24:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:34,806 INFO L225 Difference]: With dead ends: 8672 [2019-12-27 15:24:34,806 INFO L226 Difference]: Without dead ends: 8672 [2019-12-27 15:24:34,806 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-27 15:24:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2019-12-27 15:24:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 6627. [2019-12-27 15:24:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 15:24:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 31410 transitions. [2019-12-27 15:24:34,945 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 31410 transitions. Word has length 18 [2019-12-27 15:24:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 31410 transitions. [2019-12-27 15:24:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:24:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 31410 transitions. [2019-12-27 15:24:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:24:34,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:34,954 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:34,955 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -766676883, now seen corresponding path program 1 times [2019-12-27 15:24:34,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:34,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863003069] [2019-12-27 15:24:34,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:24:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-27 15:24:34,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863003069] [2019-12-27 15:24:34,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:24:34,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:24:34,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078271572] [2019-12-27 15:24:34,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:24:34,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:24:34,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 15:24:34,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:24:34,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:24:34,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:24:34,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:24:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:24:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:34,986 INFO L87 Difference]: Start difference. First operand 6627 states and 31410 transitions. Second operand 3 states. [2019-12-27 15:24:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:24:35,067 INFO L93 Difference]: Finished difference Result 9207 states and 43429 transitions. [2019-12-27 15:24:35,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:24:35,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 15:24:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:24:35,089 INFO L225 Difference]: With dead ends: 9207 [2019-12-27 15:24:35,089 INFO L226 Difference]: Without dead ends: 9207 [2019-12-27 15:24:35,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:24:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-27 15:24:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 7915. [2019-12-27 15:24:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2019-12-27 15:24:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 38052 transitions. [2019-12-27 15:24:35,244 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 38052 transitions. Word has length 20 [2019-12-27 15:24:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:24:35,244 INFO L462 AbstractCegarLoop]: Abstraction has 7915 states and 38052 transitions. [2019-12-27 15:24:35,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:24:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 38052 transitions. [2019-12-27 15:24:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:24:35,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:24:35,248 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:24:35,248 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:24:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:24:35,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2002648867, now seen corresponding path program 1 times [2019-12-27 15:24:35,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:24:35,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211371536] [2019-12-27 15:24:35,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:24:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:24:35,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:24:35,265 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:24:35,266 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:24:35,266 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,276 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,278 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,279 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,280 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,281 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,284 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,284 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,289 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,289 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,290 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,291 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,291 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,291 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,291 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,291 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,292 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,292 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,293 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,293 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,293 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,293 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,294 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,294 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,294 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,294 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,295 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,295 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,296 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,297 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,298 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,298 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,298 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,298 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,298 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,299 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,299 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,299 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:24:35,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 15:24:35,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:24:35,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:24:35,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:24:35,301 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:24:35,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:24:35,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:24:35,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:24:35,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:24:35,303 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions [2019-12-27 15:24:35,303 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 15:24:35,330 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 15:24:35,330 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 15:24:35,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 15:24:35,351 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 15:24:35,377 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 15:24:35,378 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 15:24:35,382 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 15:24:35,393 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2019-12-27 15:24:35,393 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:24:36,858 INFO L206 etLargeBlockEncoding]: Checked pairs total: 12130 [2019-12-27 15:24:36,858 INFO L214 etLargeBlockEncoding]: Total number of compositions: 88 [2019-12-27 15:24:36,859 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions [2019-12-27 15:25:28,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160420 states. [2019-12-27 15:25:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 160420 states. [2019-12-27 15:25:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:25:28,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:25:28,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:25:28,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:25:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:25:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1044393949, now seen corresponding path program 1 times [2019-12-27 15:25:28,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:25:28,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045505287] [2019-12-27 15:25:28,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:25:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:25:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:25:28,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045505287] [2019-12-27 15:25:28,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:25:28,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:25:28,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911765976] [2019-12-27 15:25:28,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:25:28,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:25:28,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:25:28,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:25:28,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:25:28,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:25:28,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:25:28,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:25:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:25:28,432 INFO L87 Difference]: Start difference. First operand 160420 states. Second operand 3 states. [2019-12-27 15:25:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:25:30,815 INFO L93 Difference]: Finished difference Result 190005 states and 1117019 transitions. [2019-12-27 15:25:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:25:30,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:25:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:25:31,572 INFO L225 Difference]: With dead ends: 190005 [2019-12-27 15:25:31,573 INFO L226 Difference]: Without dead ends: 190005 [2019-12-27 15:25:31,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:25:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190005 states. [2019-12-27 15:25:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190005 to 158349. [2019-12-27 15:25:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158349 states. [2019-12-27 15:25:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158349 states to 158349 states and 952006 transitions. [2019-12-27 15:25:53,117 INFO L78 Accepts]: Start accepts. Automaton has 158349 states and 952006 transitions. Word has length 5 [2019-12-27 15:25:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:25:53,117 INFO L462 AbstractCegarLoop]: Abstraction has 158349 states and 952006 transitions. [2019-12-27 15:25:53,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:25:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 158349 states and 952006 transitions. [2019-12-27 15:25:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 15:25:53,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:25:53,118 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:25:53,118 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:25:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:25:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 610026521, now seen corresponding path program 1 times [2019-12-27 15:25:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:25:53,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214250249] [2019-12-27 15:25:53,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:25:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:25:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:25:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214250249] [2019-12-27 15:25:53,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:25:53,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:25:53,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115775455] [2019-12-27 15:25:53,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:25:53,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:25:53,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 15:25:53,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:25:53,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:25:53,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:25:53,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:25:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:25:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:25:53,140 INFO L87 Difference]: Start difference. First operand 158349 states and 952006 transitions. Second operand 3 states. [2019-12-27 15:26:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:26:03,624 INFO L93 Difference]: Finished difference Result 246811 states and 1468819 transitions. [2019-12-27 15:26:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:26:03,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 15:26:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:26:05,754 INFO L225 Difference]: With dead ends: 246811 [2019-12-27 15:26:05,754 INFO L226 Difference]: Without dead ends: 246811 [2019-12-27 15:26:05,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:26:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246811 states. [2019-12-27 15:26:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246811 to 183575. [2019-12-27 15:26:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183575 states. [2019-12-27 15:26:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183575 states to 183575 states and 1107523 transitions. [2019-12-27 15:26:30,819 INFO L78 Accepts]: Start accepts. Automaton has 183575 states and 1107523 transitions. Word has length 8 [2019-12-27 15:26:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:26:30,819 INFO L462 AbstractCegarLoop]: Abstraction has 183575 states and 1107523 transitions. [2019-12-27 15:26:30,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:26:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 183575 states and 1107523 transitions. [2019-12-27 15:26:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:26:30,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:26:30,820 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:26:30,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:26:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:26:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1165029829, now seen corresponding path program 1 times [2019-12-27 15:26:30,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:26:30,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012149706] [2019-12-27 15:26:30,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:26:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:26:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:26:30,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012149706] [2019-12-27 15:26:30,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:26:30,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:26:30,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691875802] [2019-12-27 15:26:30,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:26:30,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:26:30,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:26:30,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:26:30,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:26:30,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:26:30,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:26:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:26:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:26:30,855 INFO L87 Difference]: Start difference. First operand 183575 states and 1107523 transitions. Second operand 4 states. [2019-12-27 15:26:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:26:33,699 INFO L93 Difference]: Finished difference Result 145622 states and 870444 transitions. [2019-12-27 15:26:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:26:33,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:26:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:26:34,237 INFO L225 Difference]: With dead ends: 145622 [2019-12-27 15:26:34,237 INFO L226 Difference]: Without dead ends: 145622 [2019-12-27 15:26:34,237 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-27 15:26:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145622 states. [2019-12-27 15:26:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145622 to 114004. [2019-12-27 15:26:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114004 states. [2019-12-27 15:26:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114004 states to 114004 states and 673987 transitions. [2019-12-27 15:26:47,452 INFO L78 Accepts]: Start accepts. Automaton has 114004 states and 673987 transitions. Word has length 9 [2019-12-27 15:26:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:26:47,453 INFO L462 AbstractCegarLoop]: Abstraction has 114004 states and 673987 transitions. [2019-12-27 15:26:47,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:26:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 114004 states and 673987 transitions. [2019-12-27 15:26:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:26:47,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:26:47,453 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:26:47,453 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:26:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:26:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1730955589, now seen corresponding path program 1 times [2019-12-27 15:26:47,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:26:47,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520147916] [2019-12-27 15:26:47,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:26:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:26:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:26:47,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520147916] [2019-12-27 15:26:47,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:26:47,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:26:47,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33479744] [2019-12-27 15:26:47,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:26:47,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:26:47,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 15:26:47,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:26:47,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:26:47,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:26:47,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:26:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:26:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:26:47,484 INFO L87 Difference]: Start difference. First operand 114004 states and 673987 transitions. Second operand 4 states. [2019-12-27 15:26:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:26:48,194 INFO L93 Difference]: Finished difference Result 95018 states and 558562 transitions. [2019-12-27 15:26:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:26:48,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 15:26:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:26:48,536 INFO L225 Difference]: With dead ends: 95018 [2019-12-27 15:26:48,537 INFO L226 Difference]: Without dead ends: 95018 [2019-12-27 15:26:48,537 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-27 15:26:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95018 states. [2019-12-27 15:26:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95018 to 76032. [2019-12-27 15:26:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76032 states. [2019-12-27 15:26:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76032 states to 76032 states and 443137 transitions. [2019-12-27 15:26:58,575 INFO L78 Accepts]: Start accepts. Automaton has 76032 states and 443137 transitions. Word has length 9 [2019-12-27 15:26:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:26:58,575 INFO L462 AbstractCegarLoop]: Abstraction has 76032 states and 443137 transitions. [2019-12-27 15:26:58,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:26:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76032 states and 443137 transitions. [2019-12-27 15:26:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:26:58,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:26:58,576 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 15:26:58,576 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:26:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:26:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1101646248, now seen corresponding path program 1 times [2019-12-27 15:26:58,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:26:58,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930726955] [2019-12-27 15:26:58,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:26:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:26:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:26:58,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930726955] [2019-12-27 15:26:58,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:26:58,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:26:58,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944159237] [2019-12-27 15:26:58,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:26:58,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:26:58,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:26:58,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:26:58,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:26:58,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:26:58,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:26:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:26:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:26:58,590 INFO L87 Difference]: Start difference. First operand 76032 states and 443137 transitions. Second operand 3 states. [2019-12-27 15:26:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:26:59,476 INFO L93 Difference]: Finished difference Result 113976 states and 654880 transitions. [2019-12-27 15:26:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:26:59,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:26:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:01,044 INFO L225 Difference]: With dead ends: 113976 [2019-12-27 15:27:01,045 INFO L226 Difference]: Without dead ends: 113976 [2019-12-27 15:27:01,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-12-27 15:27:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 94996. [2019-12-27 15:27:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94996 states. [2019-12-27 15:27:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94996 states to 94996 states and 558450 transitions. [2019-12-27 15:27:10,315 INFO L78 Accepts]: Start accepts. Automaton has 94996 states and 558450 transitions. Word has length 11 [2019-12-27 15:27:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:10,315 INFO L462 AbstractCegarLoop]: Abstraction has 94996 states and 558450 transitions. [2019-12-27 15:27:10,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 94996 states and 558450 transitions. [2019-12-27 15:27:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:27:10,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:10,316 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:10,316 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -208702148, now seen corresponding path program 1 times [2019-12-27 15:27:10,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:10,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679463286] [2019-12-27 15:27:10,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 15:27:10,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679463286] [2019-12-27 15:27:10,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:10,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:10,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784203941] [2019-12-27 15:27:10,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:10,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:10,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 15:27:10,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:10,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:10,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:27:10,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:27:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:27:10,338 INFO L87 Difference]: Start difference. First operand 94996 states and 558450 transitions. Second operand 4 states. [2019-12-27 15:27:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:12,024 INFO L93 Difference]: Finished difference Result 76016 states and 443040 transitions. [2019-12-27 15:27:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:12,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 15:27:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:12,313 INFO L225 Difference]: With dead ends: 76016 [2019-12-27 15:27:12,314 INFO L226 Difference]: Without dead ends: 76016 [2019-12-27 15:27:12,314 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-27 15:27:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76016 states. Received shutdown request... [2019-12-27 15:27:18,608 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 15:27:18,611 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 15:27:18,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:27:18 BasicIcfg [2019-12-27 15:27:18,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:27:18,613 INFO L168 Benchmark]: Toolchain (without parser) took 197360.10 ms. Allocated memory was 136.3 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 99.5 MB in the beginning and 3.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,614 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.87 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 99.1 MB in the beginning and 162.1 MB in the end (delta: -63.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.05 ms. Allocated memory is still 201.9 MB. Free memory was 162.1 MB in the beginning and 159.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,614 INFO L168 Benchmark]: Boogie Preprocessor took 25.73 ms. Allocated memory is still 201.9 MB. Free memory was 159.9 MB in the beginning and 158.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,615 INFO L168 Benchmark]: RCFGBuilder took 407.57 ms. Allocated memory is still 201.9 MB. Free memory was 158.4 MB in the beginning and 142.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,615 INFO L168 Benchmark]: TraceAbstraction took 196156.36 ms. Allocated memory was 201.9 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 141.8 MB in the beginning and 3.1 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-12-27 15:27:18,617 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.17 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.87 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 99.1 MB in the beginning and 162.1 MB in the end (delta: -63.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.05 ms. Allocated memory is still 201.9 MB. Free memory was 162.1 MB in the beginning and 159.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.73 ms. Allocated memory is still 201.9 MB. Free memory was 159.9 MB in the beginning and 158.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 407.57 ms. Allocated memory is still 201.9 MB. Free memory was 158.4 MB in the beginning and 142.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196156.36 ms. Allocated memory was 201.9 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 141.8 MB in the beginning and 3.1 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 34 ProgramPointsBefore, 9 ProgramPointsAfterwards, 33 TransitionsBefore, 8 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 160 CheckedPairsTotal, 29 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 48 ProgramPointsBefore, 15 ProgramPointsAfterwards, 46 TransitionsBefore, 13 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 430 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 18 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 35 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 62 ProgramPointsBefore, 20 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 4 ChoiceCompositions, 889 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2078 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1517 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3457 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 90 ProgramPointsBefore, 30 ProgramPointsAfterwards, 85 TransitionsBefore, 25 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 6 ChoiceCompositions, 2342 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 5838 CheckedPairsTotal, 65 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 3289 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 8316 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 111 TransitionsBefore, 37 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 6 ChoiceCompositions, 4493 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 83 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 12130 CheckedPairsTotal, 88 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Result: TIMEOUT, OverallTime: 163.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 282 SDtfs, 214 SDslu, 151 SDs, 0 SdLazy, 212 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183575occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 164476 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 20/20 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