/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-15 13:01:34,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-15 13:01:34,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-15 13:01:34,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-15 13:01:34,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-15 13:01:34,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-15 13:01:34,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-15 13:01:34,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-15 13:01:34,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-15 13:01:34,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-15 13:01:34,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-15 13:01:34,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-15 13:01:34,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-15 13:01:34,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-15 13:01:34,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-15 13:01:34,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-15 13:01:34,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-15 13:01:34,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-15 13:01:34,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-15 13:01:34,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-15 13:01:34,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-15 13:01:34,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-15 13:01:34,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-15 13:01:34,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-15 13:01:34,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-15 13:01:34,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-15 13:01:34,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-15 13:01:34,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-15 13:01:34,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-15 13:01:34,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-15 13:01:34,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-15 13:01:34,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-15 13:01:34,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-15 13:01:34,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-15 13:01:34,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-15 13:01:34,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-15 13:01:34,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-15 13:01:34,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-15 13:01:34,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-15 13:01:34,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-15 13:01:34,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-15 13:01:34,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-09-15 13:01:34,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-15 13:01:34,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-15 13:01:34,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-15 13:01:34,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-15 13:01:34,718 INFO L138 SettingsManager]: * Use SBE=true [2020-09-15 13:01:34,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-15 13:01:34,718 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-15 13:01:34,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-15 13:01:34,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-15 13:01:34,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-15 13:01:34,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-15 13:01:34,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-15 13:01:34,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-15 13:01:34,720 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-15 13:01:34,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-15 13:01:34,720 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-15 13:01:34,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-15 13:01:34,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-15 13:01:34,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-15 13:01:34,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-15 13:01:34,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-15 13:01:34,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-15 13:01:34,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-15 13:01:34,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-15 13:01:34,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-15 13:01:34,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-15 13:01:34,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-15 13:01:34,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-15 13:01:34,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-15 13:01:35,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-15 13:01:35,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-15 13:01:35,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-15 13:01:35,178 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-15 13:01:35,179 INFO L275 PluginConnector]: CDTParser initialized [2020-09-15 13:01:35,180 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-15 13:01:35,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b062b62f/6488f95c38454e5da3907afcb8ada4c0/FLAG4930619a1 [2020-09-15 13:01:36,034 INFO L306 CDTParser]: Found 1 translation units. [2020-09-15 13:01:36,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-09-15 13:01:36,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b062b62f/6488f95c38454e5da3907afcb8ada4c0/FLAG4930619a1 [2020-09-15 13:01:36,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b062b62f/6488f95c38454e5da3907afcb8ada4c0 [2020-09-15 13:01:36,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-15 13:01:36,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-15 13:01:36,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-15 13:01:36,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-15 13:01:36,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-15 13:01:36,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 01:01:36" (1/1) ... [2020-09-15 13:01:36,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b9472c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:36, skipping insertion in model container [2020-09-15 13:01:36,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 01:01:36" (1/1) ... [2020-09-15 13:01:36,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-15 13:01:36,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-15 13:01:37,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 13:01:37,155 INFO L203 MainTranslator]: Completed pre-run [2020-09-15 13:01:37,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 13:01:37,831 INFO L208 MainTranslator]: Completed translation [2020-09-15 13:01:37,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37 WrapperNode [2020-09-15 13:01:37,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-15 13:01:37,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-15 13:01:37,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-15 13:01:37,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-15 13:01:37,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:37,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:37,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-15 13:01:37,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-15 13:01:37,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-15 13:01:37,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-15 13:01:38,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... [2020-09-15 13:01:38,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-15 13:01:38,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-15 13:01:38,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-15 13:01:38,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-15 13:01:38,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-15 13:01:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-15 13:01:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-15 13:01:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-15 13:01:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-15 13:01:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-15 13:01:38,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-15 13:01:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-15 13:01:38,194 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-15 13:01:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-15 13:01:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-15 13:01:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-15 13:01:38,200 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-15 13:01:38,915 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-15 13:01:38,916 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-15 13:01:38,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 01:01:38 BoogieIcfgContainer [2020-09-15 13:01:38,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-15 13:01:38,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-15 13:01:38,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-15 13:01:38,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-15 13:01:38,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 01:01:36" (1/3) ... [2020-09-15 13:01:38,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbd1ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 01:01:38, skipping insertion in model container [2020-09-15 13:01:38,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:01:37" (2/3) ... [2020-09-15 13:01:38,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbd1ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 01:01:38, skipping insertion in model container [2020-09-15 13:01:38,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 01:01:38" (3/3) ... [2020-09-15 13:01:38,933 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-09-15 13:01:38,946 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-15 13:01:38,946 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-15 13:01:38,957 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-15 13:01:38,958 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-15 13:01:38,998 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:38,999 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:38,999 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:38,999 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,000 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,000 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,000 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,001 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,001 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,001 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,001 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,001 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,002 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,002 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,002 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,003 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,003 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,003 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,003 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,004 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,004 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,004 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,004 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,005 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,005 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,005 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,006 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,006 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,006 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,007 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,007 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,007 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,007 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,008 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,008 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,008 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,009 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,009 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,009 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,009 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,009 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,010 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,010 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,011 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,011 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,011 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,011 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,012 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,012 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,012 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,013 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,013 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,013 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,013 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,014 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,014 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,014 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,015 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,021 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,022 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,022 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,023 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,023 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,024 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,024 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,031 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,031 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,031 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,032 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,032 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,032 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,033 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,033 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:01:39,067 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-15 13:01:39,095 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-15 13:01:39,096 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-15 13:01:39,096 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-15 13:01:39,096 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-15 13:01:39,096 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-15 13:01:39,097 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-15 13:01:39,097 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-15 13:01:39,097 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-15 13:01:39,120 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-09-15 13:01:39,123 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-15 13:01:39,211 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-15 13:01:39,211 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 13:01:39,218 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-15 13:01:39,223 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-09-15 13:01:39,295 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-09-15 13:01:39,295 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 13:01:39,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-15 13:01:39,300 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2652 [2020-09-15 13:01:39,303 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-15 13:01:40,428 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:40,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:40,474 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:40,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:40,503 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:40,503 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-09-15 13:01:41,426 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-15 13:01:42,177 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:42,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:42,204 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:42,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:42,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:42,224 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-09-15 13:01:42,799 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-09-15 13:01:43,223 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-09-15 13:01:43,961 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-09-15 13:01:44,087 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-09-15 13:01:44,517 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-09-15 13:01:44,549 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:44,717 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-09-15 13:01:44,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:44,730 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:44,927 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-15 13:01:44,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:01:44,930 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-15 13:01:44,930 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-09-15 13:01:45,127 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-15 13:01:45,299 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-09-15 13:01:46,381 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-15 13:01:46,812 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-15 13:01:47,392 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-09-15 13:01:47,663 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-09-15 13:01:47,677 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5194 [2020-09-15 13:01:47,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 168 [2020-09-15 13:01:47,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-09-15 13:01:47,720 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-09-15 13:01:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-09-15 13:01:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-15 13:01:47,731 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:47,732 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-15 13:01:47,733 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-09-15 13:01:47,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:47,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414920224] [2020-09-15 13:01:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:48,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414920224] [2020-09-15 13:01:48,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:48,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-15 13:01:48,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672707018] [2020-09-15 13:01:48,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-15 13:01:48,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-15 13:01:48,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-15 13:01:48,060 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-09-15 13:01:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:48,102 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-09-15 13:01:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-15 13:01:48,104 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-15 13:01:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:48,122 INFO L225 Difference]: With dead ends: 386 [2020-09-15 13:01:48,123 INFO L226 Difference]: Without dead ends: 348 [2020-09-15 13:01:48,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-15 13:01:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-09-15 13:01:48,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-09-15 13:01:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-09-15 13:01:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-09-15 13:01:48,209 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-09-15 13:01:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:48,209 INFO L479 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-09-15 13:01:48,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-15 13:01:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-09-15 13:01:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-15 13:01:48,210 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:48,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-15 13:01:48,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-15 13:01:48,211 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-09-15 13:01:48,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:48,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088981477] [2020-09-15 13:01:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:48,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088981477] [2020-09-15 13:01:48,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 13:01:48,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076212223] [2020-09-15 13:01:48,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:01:48,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:01:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:01:48,502 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-09-15 13:01:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:48,607 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-09-15 13:01:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:01:48,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-15 13:01:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:48,614 INFO L225 Difference]: With dead ends: 471 [2020-09-15 13:01:48,614 INFO L226 Difference]: Without dead ends: 471 [2020-09-15 13:01:48,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:01:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-09-15 13:01:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-09-15 13:01:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-09-15 13:01:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-09-15 13:01:48,681 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-09-15 13:01:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:48,681 INFO L479 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-09-15 13:01:48,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:01:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-09-15 13:01:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-15 13:01:48,687 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:48,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-15 13:01:48,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-15 13:01:48,688 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-09-15 13:01:48,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:48,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023278297] [2020-09-15 13:01:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:48,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023278297] [2020-09-15 13:01:48,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:48,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 13:01:48,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144960709] [2020-09-15 13:01:48,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:01:48,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:01:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:01:48,903 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-09-15 13:01:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:48,978 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-09-15 13:01:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:01:48,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-15 13:01:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:48,983 INFO L225 Difference]: With dead ends: 498 [2020-09-15 13:01:48,983 INFO L226 Difference]: Without dead ends: 482 [2020-09-15 13:01:48,983 INFO L675 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 [2020-09-15 13:01:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-15 13:01:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-09-15 13:01:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-09-15 13:01:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-09-15 13:01:49,008 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-09-15 13:01:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:49,008 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-09-15 13:01:49,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:01:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-09-15 13:01:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-15 13:01:49,012 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:49,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:49,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-15 13:01:49,012 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-09-15 13:01:49,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:49,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751257836] [2020-09-15 13:01:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:49,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751257836] [2020-09-15 13:01:49,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:49,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 13:01:49,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377069679] [2020-09-15 13:01:49,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:01:49,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:01:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:01:49,160 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-09-15 13:01:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:49,179 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-09-15 13:01:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:01:49,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-15 13:01:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:49,182 INFO L225 Difference]: With dead ends: 162 [2020-09-15 13:01:49,182 INFO L226 Difference]: Without dead ends: 162 [2020-09-15 13:01:49,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:01:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-15 13:01:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-09-15 13:01:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-15 13:01:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-09-15 13:01:49,188 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-09-15 13:01:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:49,189 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-09-15 13:01:49,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:01:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-09-15 13:01:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:49,197 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:49,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:49,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-15 13:01:49,198 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-09-15 13:01:49,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:49,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655869294] [2020-09-15 13:01:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:49,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655869294] [2020-09-15 13:01:49,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:49,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-15 13:01:49,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536125122] [2020-09-15 13:01:49,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-15 13:01:49,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-15 13:01:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-15 13:01:49,483 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-09-15 13:01:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:49,650 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-09-15 13:01:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-15 13:01:49,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-15 13:01:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:49,652 INFO L225 Difference]: With dead ends: 206 [2020-09-15 13:01:49,652 INFO L226 Difference]: Without dead ends: 206 [2020-09-15 13:01:49,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:01:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-15 13:01:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-09-15 13:01:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-09-15 13:01:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-09-15 13:01:49,660 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-09-15 13:01:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:49,661 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-09-15 13:01:49,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-15 13:01:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-09-15 13:01:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:49,664 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:49,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:49,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-15 13:01:49,665 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-09-15 13:01:49,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:49,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756838978] [2020-09-15 13:01:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:50,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756838978] [2020-09-15 13:01:50,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:50,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:01:50,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788312310] [2020-09-15 13:01:50,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:01:50,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:01:50,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:50,849 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-09-15 13:01:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:52,155 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-09-15 13:01:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 13:01:52,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:01:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:52,158 INFO L225 Difference]: With dead ends: 314 [2020-09-15 13:01:52,158 INFO L226 Difference]: Without dead ends: 314 [2020-09-15 13:01:52,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-09-15 13:01:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-09-15 13:01:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-09-15 13:01:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-09-15 13:01:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-09-15 13:01:52,168 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-09-15 13:01:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:52,168 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-09-15 13:01:52,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:01:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-09-15 13:01:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:52,170 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:52,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:52,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-15 13:01:52,171 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-09-15 13:01:52,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:52,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565726494] [2020-09-15 13:01:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:52,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565726494] [2020-09-15 13:01:52,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:52,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 13:01:52,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152550891] [2020-09-15 13:01:52,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:01:52,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:01:52,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:01:52,650 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-09-15 13:01:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:53,027 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-09-15 13:01:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-15 13:01:53,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:01:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:53,031 INFO L225 Difference]: With dead ends: 369 [2020-09-15 13:01:53,031 INFO L226 Difference]: Without dead ends: 319 [2020-09-15 13:01:53,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-09-15 13:01:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-09-15 13:01:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-09-15 13:01:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-09-15 13:01:53,042 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-09-15 13:01:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:53,042 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-09-15 13:01:53,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:01:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-09-15 13:01:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:53,044 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:53,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:53,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-15 13:01:53,044 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-09-15 13:01:53,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:53,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195615591] [2020-09-15 13:01:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:53,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195615591] [2020-09-15 13:01:53,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:53,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 13:01:53,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492728210] [2020-09-15 13:01:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-15 13:01:53,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-15 13:01:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-15 13:01:53,291 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-09-15 13:01:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:53,317 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-09-15 13:01:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-15 13:01:53,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-09-15 13:01:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:53,319 INFO L225 Difference]: With dead ends: 162 [2020-09-15 13:01:53,319 INFO L226 Difference]: Without dead ends: 157 [2020-09-15 13:01:53,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-15 13:01:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-09-15 13:01:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-09-15 13:01:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-09-15 13:01:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-09-15 13:01:53,325 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-09-15 13:01:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:53,325 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-09-15 13:01:53,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-15 13:01:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-09-15 13:01:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:53,326 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:53,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:53,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-15 13:01:53,327 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-09-15 13:01:53,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:53,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349035972] [2020-09-15 13:01:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:53,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349035972] [2020-09-15 13:01:53,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:53,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 13:01:53,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127921933] [2020-09-15 13:01:53,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:01:53,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:01:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:01:53,743 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-09-15 13:01:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:54,188 INFO L93 Difference]: Finished difference Result 177 states and 284 transitions. [2020-09-15 13:01:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 13:01:54,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:01:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:54,190 INFO L225 Difference]: With dead ends: 177 [2020-09-15 13:01:54,190 INFO L226 Difference]: Without dead ends: 177 [2020-09-15 13:01:54,191 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-09-15 13:01:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2020-09-15 13:01:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-15 13:01:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 252 transitions. [2020-09-15 13:01:54,196 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 252 transitions. Word has length 22 [2020-09-15 13:01:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:54,196 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 252 transitions. [2020-09-15 13:01:54,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:01:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 252 transitions. [2020-09-15 13:01:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:54,197 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:54,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:54,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-15 13:01:54,198 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-09-15 13:01:54,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:54,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508527459] [2020-09-15 13:01:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:55,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508527459] [2020-09-15 13:01:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:01:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175629617] [2020-09-15 13:01:55,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:01:55,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:01:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:55,063 INFO L87 Difference]: Start difference. First operand 155 states and 252 transitions. Second operand 12 states. [2020-09-15 13:01:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:55,804 INFO L93 Difference]: Finished difference Result 168 states and 264 transitions. [2020-09-15 13:01:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 13:01:55,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:01:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:55,806 INFO L225 Difference]: With dead ends: 168 [2020-09-15 13:01:55,806 INFO L226 Difference]: Without dead ends: 155 [2020-09-15 13:01:55,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-09-15 13:01:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-15 13:01:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-09-15 13:01:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-15 13:01:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 251 transitions. [2020-09-15 13:01:55,812 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 251 transitions. Word has length 22 [2020-09-15 13:01:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:55,814 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 251 transitions. [2020-09-15 13:01:55,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:01:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 251 transitions. [2020-09-15 13:01:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:55,815 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:55,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:55,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-15 13:01:55,815 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1716865024, now seen corresponding path program 3 times [2020-09-15 13:01:55,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:55,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638379748] [2020-09-15 13:01:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:56,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638379748] [2020-09-15 13:01:56,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:56,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 13:01:56,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487043575] [2020-09-15 13:01:56,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:01:56,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:01:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:01:56,320 INFO L87 Difference]: Start difference. First operand 155 states and 251 transitions. Second operand 8 states. [2020-09-15 13:01:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:56,767 INFO L93 Difference]: Finished difference Result 150 states and 237 transitions. [2020-09-15 13:01:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 13:01:56,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:01:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:56,769 INFO L225 Difference]: With dead ends: 150 [2020-09-15 13:01:56,769 INFO L226 Difference]: Without dead ends: 150 [2020-09-15 13:01:56,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-09-15 13:01:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2020-09-15 13:01:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-09-15 13:01:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-09-15 13:01:56,775 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-09-15 13:01:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:56,775 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-09-15 13:01:56,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:01:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-09-15 13:01:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:56,777 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:56,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:56,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-15 13:01:56,778 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-09-15 13:01:56,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:56,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189426610] [2020-09-15 13:01:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:57,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189426610] [2020-09-15 13:01:57,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:57,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:01:57,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30657750] [2020-09-15 13:01:57,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:01:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:01:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:57,696 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-09-15 13:01:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:01:58,533 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-09-15 13:01:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:01:58,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:01:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:01:58,536 INFO L225 Difference]: With dead ends: 142 [2020-09-15 13:01:58,536 INFO L226 Difference]: Without dead ends: 130 [2020-09-15 13:01:58,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-15 13:01:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-09-15 13:01:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-09-15 13:01:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-09-15 13:01:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-09-15 13:01:58,541 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-09-15 13:01:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:01:58,542 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-09-15 13:01:58,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:01:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-09-15 13:01:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:01:58,543 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:01:58,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:01:58,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-15 13:01:58,543 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:01:58,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:01:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-09-15 13:01:58,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:01:58,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023122044] [2020-09-15 13:01:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:01:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:01:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:01:59,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023122044] [2020-09-15 13:01:59,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:01:59,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:01:59,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863845529] [2020-09-15 13:01:59,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:01:59,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:01:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:01:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:01:59,334 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-09-15 13:02:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:00,078 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-09-15 13:02:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:00,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:00,080 INFO L225 Difference]: With dead ends: 149 [2020-09-15 13:02:00,081 INFO L226 Difference]: Without dead ends: 149 [2020-09-15 13:02:00,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-09-15 13:02:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-09-15 13:02:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-09-15 13:02:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-09-15 13:02:00,085 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-09-15 13:02:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:00,086 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-09-15 13:02:00,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-09-15 13:02:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:00,087 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:00,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:00,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-15 13:02:00,087 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-09-15 13:02:00,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:00,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351656823] [2020-09-15 13:02:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:00,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351656823] [2020-09-15 13:02:00,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:00,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 13:02:00,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100448987] [2020-09-15 13:02:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:02:00,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:02:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:02:00,573 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-09-15 13:02:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:00,844 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-09-15 13:02:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 13:02:00,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:02:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:00,845 INFO L225 Difference]: With dead ends: 191 [2020-09-15 13:02:00,846 INFO L226 Difference]: Without dead ends: 165 [2020-09-15 13:02:00,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-09-15 13:02:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-09-15 13:02:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-15 13:02:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-09-15 13:02:00,851 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-09-15 13:02:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:00,853 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-09-15 13:02:00,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:02:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-09-15 13:02:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:00,854 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:00,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:00,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-15 13:02:00,855 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 4 times [2020-09-15 13:02:00,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:00,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664428480] [2020-09-15 13:02:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:01,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664428480] [2020-09-15 13:02:01,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:01,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-15 13:02:01,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207395971] [2020-09-15 13:02:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 13:02:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 13:02:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-09-15 13:02:01,822 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 14 states. [2020-09-15 13:02:02,190 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-09-15 13:02:02,678 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-09-15 13:02:03,069 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-09-15 13:02:03,449 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-09-15 13:02:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:03,738 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2020-09-15 13:02:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-15 13:02:03,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 13:02:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:03,741 INFO L225 Difference]: With dead ends: 186 [2020-09-15 13:02:03,741 INFO L226 Difference]: Without dead ends: 177 [2020-09-15 13:02:03,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2020-09-15 13:02:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-09-15 13:02:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2020-09-15 13:02:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-09-15 13:02:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2020-09-15 13:02:03,747 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 22 [2020-09-15 13:02:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:03,747 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2020-09-15 13:02:03,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 13:02:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2020-09-15 13:02:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:03,748 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:03,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:03,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-15 13:02:03,749 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:03,749 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-09-15 13:02:03,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:03,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962024185] [2020-09-15 13:02:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:04,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962024185] [2020-09-15 13:02:04,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:04,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:04,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912190193] [2020-09-15 13:02:04,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:04,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:04,582 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand 12 states. [2020-09-15 13:02:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:05,283 INFO L93 Difference]: Finished difference Result 139 states and 209 transitions. [2020-09-15 13:02:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:05,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:05,285 INFO L225 Difference]: With dead ends: 139 [2020-09-15 13:02:05,285 INFO L226 Difference]: Without dead ends: 128 [2020-09-15 13:02:05,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-15 13:02:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2020-09-15 13:02:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-15 13:02:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2020-09-15 13:02:05,290 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 22 [2020-09-15 13:02:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:05,290 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2020-09-15 13:02:05,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2020-09-15 13:02:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:05,291 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:05,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:05,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-15 13:02:05,291 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1633571078, now seen corresponding path program 5 times [2020-09-15 13:02:05,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:05,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808832312] [2020-09-15 13:02:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:06,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808832312] [2020-09-15 13:02:06,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:06,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-15 13:02:06,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803215067] [2020-09-15 13:02:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-15 13:02:06,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-15 13:02:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-15 13:02:06,019 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand 15 states. [2020-09-15 13:02:07,457 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-09-15 13:02:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:07,794 INFO L93 Difference]: Finished difference Result 160 states and 251 transitions. [2020-09-15 13:02:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-15 13:02:07,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-09-15 13:02:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:07,796 INFO L225 Difference]: With dead ends: 160 [2020-09-15 13:02:07,796 INFO L226 Difference]: Without dead ends: 152 [2020-09-15 13:02:07,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2020-09-15 13:02:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-15 13:02:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 112. [2020-09-15 13:02:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-15 13:02:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2020-09-15 13:02:07,802 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 22 [2020-09-15 13:02:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:07,802 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2020-09-15 13:02:07,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-15 13:02:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2020-09-15 13:02:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:07,803 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:07,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:07,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-15 13:02:07,803 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-09-15 13:02:07,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:07,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429969471] [2020-09-15 13:02:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:08,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429969471] [2020-09-15 13:02:08,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477710025] [2020-09-15 13:02:08,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:08,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:08,558 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand 12 states. [2020-09-15 13:02:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:09,283 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-09-15 13:02:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:09,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:09,285 INFO L225 Difference]: With dead ends: 120 [2020-09-15 13:02:09,285 INFO L226 Difference]: Without dead ends: 96 [2020-09-15 13:02:09,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-15 13:02:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-09-15 13:02:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-15 13:02:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2020-09-15 13:02:09,289 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 22 [2020-09-15 13:02:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:09,289 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2020-09-15 13:02:09,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2020-09-15 13:02:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:09,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:09,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:09,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-15 13:02:09,291 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:09,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-09-15 13:02:09,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:09,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894159201] [2020-09-15 13:02:09,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:10,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894159201] [2020-09-15 13:02:10,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207234514] [2020-09-15 13:02:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:10,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:10,007 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand 12 states. [2020-09-15 13:02:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:10,656 INFO L93 Difference]: Finished difference Result 96 states and 146 transitions. [2020-09-15 13:02:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:02:10,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:10,658 INFO L225 Difference]: With dead ends: 96 [2020-09-15 13:02:10,658 INFO L226 Difference]: Without dead ends: 81 [2020-09-15 13:02:10,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-15 13:02:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-15 13:02:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-15 13:02:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 131 transitions. [2020-09-15 13:02:10,662 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 131 transitions. Word has length 22 [2020-09-15 13:02:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:10,662 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 131 transitions. [2020-09-15 13:02:10,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 131 transitions. [2020-09-15 13:02:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:10,663 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:10,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:10,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-15 13:02:10,663 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-09-15 13:02:10,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:10,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3781458] [2020-09-15 13:02:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:11,212 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-09-15 13:02:11,367 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2020-09-15 13:02:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:11,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3781458] [2020-09-15 13:02:11,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:11,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:11,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768341419] [2020-09-15 13:02:11,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:11,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:11,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:11,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:11,670 INFO L87 Difference]: Start difference. First operand 81 states and 131 transitions. Second operand 12 states. [2020-09-15 13:02:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:12,461 INFO L93 Difference]: Finished difference Result 112 states and 176 transitions. [2020-09-15 13:02:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:12,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:12,463 INFO L225 Difference]: With dead ends: 112 [2020-09-15 13:02:12,464 INFO L226 Difference]: Without dead ends: 112 [2020-09-15 13:02:12,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-15 13:02:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-09-15 13:02:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-15 13:02:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 176 transitions. [2020-09-15 13:02:12,468 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 176 transitions. Word has length 22 [2020-09-15 13:02:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:12,468 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 176 transitions. [2020-09-15 13:02:12,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 176 transitions. [2020-09-15 13:02:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:12,469 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:12,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:12,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-15 13:02:12,470 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-09-15 13:02:12,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:12,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884314745] [2020-09-15 13:02:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:12,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884314745] [2020-09-15 13:02:12,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:12,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 13:02:12,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846238464] [2020-09-15 13:02:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:02:12,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:02:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:02:12,899 INFO L87 Difference]: Start difference. First operand 111 states and 176 transitions. Second operand 8 states. [2020-09-15 13:02:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:13,210 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2020-09-15 13:02:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-15 13:02:13,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:02:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:13,212 INFO L225 Difference]: With dead ends: 136 [2020-09-15 13:02:13,212 INFO L226 Difference]: Without dead ends: 105 [2020-09-15 13:02:13,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-15 13:02:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-15 13:02:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-15 13:02:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2020-09-15 13:02:13,216 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 22 [2020-09-15 13:02:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:13,217 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2020-09-15 13:02:13,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:02:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2020-09-15 13:02:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:13,217 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:13,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:13,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-15 13:02:13,218 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-09-15 13:02:13,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:13,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87433342] [2020-09-15 13:02:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:14,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87433342] [2020-09-15 13:02:14,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:14,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:14,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582076032] [2020-09-15 13:02:14,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:14,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:14,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:14,211 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 12 states. [2020-09-15 13:02:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:15,058 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2020-09-15 13:02:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:02:15,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:15,060 INFO L225 Difference]: With dead ends: 136 [2020-09-15 13:02:15,060 INFO L226 Difference]: Without dead ends: 94 [2020-09-15 13:02:15,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-15 13:02:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-15 13:02:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-15 13:02:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 149 transitions. [2020-09-15 13:02:15,064 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 149 transitions. Word has length 22 [2020-09-15 13:02:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:15,064 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 149 transitions. [2020-09-15 13:02:15,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 149 transitions. [2020-09-15 13:02:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:15,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:15,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:15,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-15 13:02:15,066 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-09-15 13:02:15,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:15,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295402031] [2020-09-15 13:02:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:15,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295402031] [2020-09-15 13:02:15,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:15,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:15,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102516239] [2020-09-15 13:02:15,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:15,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:15,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:15,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:15,951 INFO L87 Difference]: Start difference. First operand 94 states and 149 transitions. Second operand 12 states. [2020-09-15 13:02:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:16,694 INFO L93 Difference]: Finished difference Result 124 states and 194 transitions. [2020-09-15 13:02:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:02:16,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:16,696 INFO L225 Difference]: With dead ends: 124 [2020-09-15 13:02:16,696 INFO L226 Difference]: Without dead ends: 94 [2020-09-15 13:02:16,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-15 13:02:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-15 13:02:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-15 13:02:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2020-09-15 13:02:16,699 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 22 [2020-09-15 13:02:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:16,699 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2020-09-15 13:02:16,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2020-09-15 13:02:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:16,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:16,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:16,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-15 13:02:16,702 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:16,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-09-15 13:02:16,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:16,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373214733] [2020-09-15 13:02:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:17,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373214733] [2020-09-15 13:02:17,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544713663] [2020-09-15 13:02:17,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:17,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:17,659 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand 12 states. [2020-09-15 13:02:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:18,453 INFO L93 Difference]: Finished difference Result 112 states and 171 transitions. [2020-09-15 13:02:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:18,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:18,455 INFO L225 Difference]: With dead ends: 112 [2020-09-15 13:02:18,455 INFO L226 Difference]: Without dead ends: 112 [2020-09-15 13:02:18,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-15 13:02:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-09-15 13:02:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-15 13:02:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2020-09-15 13:02:18,459 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 22 [2020-09-15 13:02:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:18,460 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2020-09-15 13:02:18,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2020-09-15 13:02:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:18,461 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:18,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:18,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-15 13:02:18,461 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-09-15 13:02:18,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:18,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121697362] [2020-09-15 13:02:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:18,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121697362] [2020-09-15 13:02:18,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:18,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 13:02:18,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901181346] [2020-09-15 13:02:18,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 13:02:18,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 13:02:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:02:18,886 INFO L87 Difference]: Start difference. First operand 111 states and 171 transitions. Second operand 8 states. [2020-09-15 13:02:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:19,173 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2020-09-15 13:02:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 13:02:19,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 13:02:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:19,175 INFO L225 Difference]: With dead ends: 120 [2020-09-15 13:02:19,175 INFO L226 Difference]: Without dead ends: 95 [2020-09-15 13:02:19,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-15 13:02:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2020-09-15 13:02:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-15 13:02:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2020-09-15 13:02:19,178 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 22 [2020-09-15 13:02:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:19,178 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2020-09-15 13:02:19,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 13:02:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2020-09-15 13:02:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:19,179 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:19,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:19,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-15 13:02:19,179 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-09-15 13:02:19,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:19,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483422502] [2020-09-15 13:02:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:20,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483422502] [2020-09-15 13:02:20,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:20,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:20,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254302525] [2020-09-15 13:02:20,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:20,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:20,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:20,078 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand 12 states. [2020-09-15 13:02:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:20,926 INFO L93 Difference]: Finished difference Result 94 states and 141 transitions. [2020-09-15 13:02:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 13:02:20,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:20,927 INFO L225 Difference]: With dead ends: 94 [2020-09-15 13:02:20,928 INFO L226 Difference]: Without dead ends: 77 [2020-09-15 13:02:20,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-09-15 13:02:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-09-15 13:02:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2020-09-15 13:02:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-15 13:02:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-09-15 13:02:20,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 22 [2020-09-15 13:02:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:20,931 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-09-15 13:02:20,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2020-09-15 13:02:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:20,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:20,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:20,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-15 13:02:20,932 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-09-15 13:02:20,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:20,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923770771] [2020-09-15 13:02:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:21,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923770771] [2020-09-15 13:02:21,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:21,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:21,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729136158] [2020-09-15 13:02:21,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:21,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:21,716 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand 12 states. [2020-09-15 13:02:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:22,418 INFO L93 Difference]: Finished difference Result 86 states and 125 transitions. [2020-09-15 13:02:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 13:02:22,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:22,420 INFO L225 Difference]: With dead ends: 86 [2020-09-15 13:02:22,420 INFO L226 Difference]: Without dead ends: 59 [2020-09-15 13:02:22,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-15 13:02:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-09-15 13:02:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-15 13:02:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2020-09-15 13:02:22,422 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 22 [2020-09-15 13:02:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:22,422 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2020-09-15 13:02:22,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2020-09-15 13:02:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 13:02:22,423 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:02:22,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:02:22,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-15 13:02:22,423 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:02:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:02:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-09-15 13:02:22,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:02:22,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142259896] [2020-09-15 13:02:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:02:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:02:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:02:23,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142259896] [2020-09-15 13:02:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:02:23,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 13:02:23,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860368465] [2020-09-15 13:02:23,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 13:02:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:02:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 13:02:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:02:23,319 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 12 states. [2020-09-15 13:02:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:02:23,947 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2020-09-15 13:02:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:02:23,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 13:02:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:02:23,948 INFO L225 Difference]: With dead ends: 49 [2020-09-15 13:02:23,948 INFO L226 Difference]: Without dead ends: 0 [2020-09-15 13:02:23,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:02:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-15 13:02:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-15 13:02:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-15 13:02:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-15 13:02:23,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-09-15 13:02:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:02:23,950 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-15 13:02:23,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 13:02:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-15 13:02:23,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-15 13:02:23,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-15 13:02:23,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 01:02:23 BasicIcfg [2020-09-15 13:02:23,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-15 13:02:23,962 INFO L168 Benchmark]: Toolchain (without parser) took 47764.45 ms. Allocated memory was 138.9 MB in the beginning and 565.2 MB in the end (delta: 426.2 MB). Free memory was 99.1 MB in the beginning and 226.6 MB in the end (delta: -127.5 MB). Peak memory consumption was 298.7 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,963 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-15 13:02:23,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1627.36 ms. Allocated memory was 138.9 MB in the beginning and 234.4 MB in the end (delta: 95.4 MB). Free memory was 98.4 MB in the beginning and 167.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.29 ms. Allocated memory is still 234.4 MB. Free memory was 167.0 MB in the beginning and 164.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,971 INFO L168 Benchmark]: Boogie Preprocessor took 106.60 ms. Allocated memory is still 234.4 MB. Free memory was 164.0 MB in the beginning and 161.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,971 INFO L168 Benchmark]: RCFGBuilder took 821.57 ms. Allocated memory is still 234.4 MB. Free memory was 161.1 MB in the beginning and 112.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,971 INFO L168 Benchmark]: TraceAbstraction took 45031.84 ms. Allocated memory was 234.4 MB in the beginning and 565.2 MB in the end (delta: 330.8 MB). Free memory was 111.4 MB in the beginning and 226.6 MB in the end (delta: -115.2 MB). Peak memory consumption was 215.6 MB. Max. memory is 7.1 GB. [2020-09-15 13:02:23,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1627.36 ms. Allocated memory was 138.9 MB in the beginning and 234.4 MB in the end (delta: 95.4 MB). Free memory was 98.4 MB in the beginning and 167.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 158.29 ms. Allocated memory is still 234.4 MB. Free memory was 167.0 MB in the beginning and 164.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.60 ms. Allocated memory is still 234.4 MB. Free memory was 164.0 MB in the beginning and 161.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.57 ms. Allocated memory is still 234.4 MB. Free memory was 161.1 MB in the beginning and 112.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45031.84 ms. Allocated memory was 234.4 MB in the beginning and 565.2 MB in the end (delta: 330.8 MB). Free memory was 111.4 MB in the beginning and 226.6 MB in the end (delta: -115.2 MB). Peak memory consumption was 215.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 150 ProgramPointsBefore, 40 ProgramPointsAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 1372 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5194 CheckedPairsTotal, 168 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.8s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 677 SDtfs, 948 SDslu, 2210 SDs, 0 SdLazy, 5479 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 23 SyntacticMatches, 35 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 469 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 238053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...