./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/bAnd5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 23:27:54,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 23:27:54,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 23:27:54,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 23:27:54,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 23:27:54,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 23:27:54,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 23:27:54,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 23:27:54,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 23:27:54,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 23:27:54,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 23:27:54,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 23:27:54,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 23:27:54,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 23:27:54,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 23:27:54,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 23:27:54,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 23:27:54,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 23:27:54,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 23:27:54,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 23:27:54,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 23:27:54,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 23:27:54,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 23:27:54,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 23:27:54,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 23:27:54,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 23:27:54,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 23:27:54,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 23:27:54,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 23:27:54,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 23:27:54,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 23:27:54,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 23:27:54,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 23:27:54,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 23:27:54,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 23:27:54,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 23:27:54,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 23:27:54,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 23:27:54,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 23:27:54,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 23:27:54,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 23:27:54,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 23:27:54,913 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 23:27:54,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 23:27:54,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 23:27:54,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 23:27:54,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 23:27:54,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 23:27:54,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 23:27:54,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 23:27:54,915 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 23:27:54,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 23:27:54,916 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 23:27:54,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 23:27:54,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 23:27:54,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 23:27:54,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 23:27:54,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 23:27:54,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 23:27:54,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 23:27:54,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:27:54,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 23:27:54,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 23:27:54,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 23:27:54,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2021-12-16 23:27:55,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 23:27:55,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 23:27:55,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 23:27:55,175 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 23:27:55,176 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 23:27:55,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2021-12-16 23:27:55,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b0e76b/e7161d1304694edea4c463097eddcd88/FLAG547cda1ae [2021-12-16 23:27:55,521 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 23:27:55,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2021-12-16 23:27:55,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b0e76b/e7161d1304694edea4c463097eddcd88/FLAG547cda1ae [2021-12-16 23:27:55,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8b0e76b/e7161d1304694edea4c463097eddcd88 [2021-12-16 23:27:55,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 23:27:55,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 23:27:55,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 23:27:55,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 23:27:55,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 23:27:55,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:27:55" (1/1) ... [2021-12-16 23:27:55,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ea84d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:55, skipping insertion in model container [2021-12-16 23:27:55,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:27:55" (1/1) ... [2021-12-16 23:27:55,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 23:27:55,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 23:27:56,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2021-12-16 23:27:56,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:27:56,146 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 23:27:56,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2021-12-16 23:27:56,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:27:56,186 INFO L208 MainTranslator]: Completed translation [2021-12-16 23:27:56,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56 WrapperNode [2021-12-16 23:27:56,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 23:27:56,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 23:27:56,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 23:27:56,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 23:27:56,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,221 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2021-12-16 23:27:56,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 23:27:56,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 23:27:56,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 23:27:56,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 23:27:56,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 23:27:56,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 23:27:56,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 23:27:56,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 23:27:56,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (1/1) ... [2021-12-16 23:27:56,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:27:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:27:56,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 23:27:56,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 23:27:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 23:27:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 23:27:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 23:27:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 23:27:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2021-12-16 23:27:56,326 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2021-12-16 23:27:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 23:27:56,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 23:27:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 23:27:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 23:27:56,386 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 23:27:56,388 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 23:27:56,518 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 23:27:56,522 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 23:27:56,522 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 23:27:56,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:27:56 BoogieIcfgContainer [2021-12-16 23:27:56,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 23:27:56,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 23:27:56,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 23:27:56,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 23:27:56,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:27:55" (1/3) ... [2021-12-16 23:27:56,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a697944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:27:56, skipping insertion in model container [2021-12-16 23:27:56,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:27:56" (2/3) ... [2021-12-16 23:27:56,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a697944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:27:56, skipping insertion in model container [2021-12-16 23:27:56,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:27:56" (3/3) ... [2021-12-16 23:27:56,529 INFO L111 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2021-12-16 23:27:56,533 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 23:27:56,533 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 23:27:56,582 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 23:27:56,587 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 23:27:56,589 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 23:27:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:27:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:27:56,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:27:56,618 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:27:56,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:27:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:27:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-16 23:27:56,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:27:56,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575484290] [2021-12-16 23:27:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:56,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:27:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 23:27:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 23:27:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-16 23:27:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:27:56,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:27:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575484290] [2021-12-16 23:27:56,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575484290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:27:56,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:27:56,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 23:27:56,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954357106] [2021-12-16 23:27:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:27:56,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 23:27:56,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:27:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 23:27:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:27:56,838 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:27:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:27:56,858 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-16 23:27:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 23:27:56,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:27:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:27:56,865 INFO L225 Difference]: With dead ends: 51 [2021-12-16 23:27:56,865 INFO L226 Difference]: Without dead ends: 23 [2021-12-16 23:27:56,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:27:56,870 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:27:56,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:27:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-16 23:27:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-16 23:27:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:27:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-16 23:27:56,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-16 23:27:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:27:56,893 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-16 23:27:56,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:27:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-16 23:27:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:27:56,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:27:56,895 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:27:56,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 23:27:56,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:27:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:27:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-16 23:27:56,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:27:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052319760] [2021-12-16 23:27:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:56,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:27:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 23:27:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 23:27:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-16 23:27:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:27:56,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:27:56,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052319760] [2021-12-16 23:27:56,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052319760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:27:56,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:27:56,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 23:27:56,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591866164] [2021-12-16 23:27:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:27:56,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 23:27:56,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:27:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 23:27:56,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:27:56,963 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:27:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:27:56,980 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-16 23:27:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 23:27:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:27:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:27:56,981 INFO L225 Difference]: With dead ends: 43 [2021-12-16 23:27:56,981 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 23:27:56,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:27:56,983 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:27:56,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:27:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 23:27:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 23:27:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:27:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-16 23:27:56,990 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-16 23:27:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:27:56,990 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-16 23:27:56,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:27:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-16 23:27:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 23:27:56,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:27:56,993 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:27:56,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 23:27:56,993 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:27:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:27:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-16 23:27:56,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:27:56,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421679658] [2021-12-16 23:27:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:56,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:27:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 23:27:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 23:27:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 23:27:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 23:27:57,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:27:57,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421679658] [2021-12-16 23:27:57,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421679658] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 23:27:57,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685902904] [2021-12-16 23:27:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:57,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:27:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:27:57,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 23:27:57,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 23:27:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 23:27:57,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:27:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:27:57,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:27:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:27:57,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685902904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:27:57,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 23:27:57,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-16 23:27:57,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310411076] [2021-12-16 23:27:57,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 23:27:57,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 23:27:57,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:27:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 23:27:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 23:27:57,408 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 23:27:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:27:57,475 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2021-12-16 23:27:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 23:27:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2021-12-16 23:27:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:27:57,476 INFO L225 Difference]: With dead ends: 47 [2021-12-16 23:27:57,476 INFO L226 Difference]: Without dead ends: 29 [2021-12-16 23:27:57,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-16 23:27:57,477 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:27:57,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:27:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-16 23:27:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-16 23:27:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:27:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 23:27:57,482 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2021-12-16 23:27:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:27:57,482 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 23:27:57,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 23:27:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-16 23:27:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 23:27:57,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:27:57,483 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:27:57,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 23:27:57,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:27:57,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:27:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:27:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-16 23:27:57,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:27:57,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40882274] [2021-12-16 23:27:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:57,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:27:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 23:27:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 23:27:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-16 23:27:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:27:57,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 23:27:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40882274] [2021-12-16 23:27:57,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40882274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 23:27:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922475041] [2021-12-16 23:27:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:57,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 23:27:57,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:27:57,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 23:27:57,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 23:27:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:27:57,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:27:57,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:27:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 23:27:57,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:27:57,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922475041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:27:57,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 23:27:57,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-16 23:27:57,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847663999] [2021-12-16 23:27:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:27:57,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 23:27:57,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 23:27:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 23:27:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:27:57,931 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:27:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:27:57,951 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-16 23:27:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 23:27:57,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2021-12-16 23:27:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:27:57,953 INFO L225 Difference]: With dead ends: 42 [2021-12-16 23:27:57,953 INFO L226 Difference]: Without dead ends: 29 [2021-12-16 23:27:57,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:27:57,954 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:27:57,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:27:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-16 23:27:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-16 23:27:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:27:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-16 23:27:57,958 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-16 23:27:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:27:57,960 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-16 23:27:57,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:27:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-16 23:27:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 23:27:57,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:27:57,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:27:57,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 23:27:58,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-16 23:27:58,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:27:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:27:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-16 23:27:58,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 23:27:58,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942869965] [2021-12-16 23:27:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:27:58,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 23:27:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 23:27:58,228 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 23:27:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 23:27:58,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 23:27:58,297 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 23:27:58,298 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 23:27:58,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 23:27:58,302 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-16 23:27:58,304 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 23:27:58,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 11:27:58 BoogieIcfgContainer [2021-12-16 23:27:58,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 23:27:58,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 23:27:58,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 23:27:58,337 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 23:27:58,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:27:56" (3/4) ... [2021-12-16 23:27:58,339 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 23:27:58,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 23:27:58,340 INFO L158 Benchmark]: Toolchain (without parser) took 2372.12ms. Allocated memory is still 113.2MB. Free memory was 82.4MB in the beginning and 51.2MB in the end (delta: 31.2MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2021-12-16 23:27:58,340 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 53.0MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:27:58,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.74ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 89.2MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 23:27:58,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 113.2MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:27:58,341 INFO L158 Benchmark]: Boogie Preprocessor took 36.02ms. Allocated memory is still 113.2MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 23:27:58,341 INFO L158 Benchmark]: RCFGBuilder took 264.24ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 75.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 23:27:58,342 INFO L158 Benchmark]: TraceAbstraction took 1812.01ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 51.8MB in the end (delta: 23.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2021-12-16 23:27:58,342 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 113.2MB. Free memory was 51.8MB in the beginning and 51.2MB in the end (delta: 640.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 23:27:58,344 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 53.0MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.74ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 89.2MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 113.2MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.02ms. Allocated memory is still 113.2MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 264.24ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 75.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1812.01ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 51.8MB in the end (delta: 23.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 113.2MB. Free memory was 51.8MB in the beginning and 51.2MB in the end (delta: 640.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={3:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}] [L45] CALL, EXPR bAnd(x) VAL [N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-2, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\result=-4, i=2, N=2, res=4294967292, x={3:0}, x={3:0}] [L45] RET, EXPR bAnd(x) VAL [bAnd(x)=-4, i=2, N=2, x={3:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=-4, temp=-2, x={3:0}] [L48] CALL, EXPR bAnd(x) VAL [N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\result=-5, i=2, N=2, res=4294967291, x={3:0}, x={3:0}] [L48] RET, EXPR bAnd(x) VAL [bAnd(x)=-5, i=2, N=2, ret=-4, temp=-2, x={3:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=-4, ret2=-5, temp=-3, x={3:0}] [L50] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2021-12-16 23:28:00,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 23:28:00,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 23:28:00,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 23:28:00,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 23:28:00,540 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 23:28:00,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2021-12-16 23:28:00,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831224400/139bf6ed092d44bc870ea6dfb1df172a/FLAG09e3173c7 [2021-12-16 23:28:00,944 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 23:28:00,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2021-12-16 23:28:00,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831224400/139bf6ed092d44bc870ea6dfb1df172a/FLAG09e3173c7 [2021-12-16 23:28:01,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831224400/139bf6ed092d44bc870ea6dfb1df172a [2021-12-16 23:28:01,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 23:28:01,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 23:28:01,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 23:28:01,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 23:28:01,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 23:28:01,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63376ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01, skipping insertion in model container [2021-12-16 23:28:01,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 23:28:01,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 23:28:01,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2021-12-16 23:28:01,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:28:01,525 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 23:28:01,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2021-12-16 23:28:01,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 23:28:01,582 INFO L208 MainTranslator]: Completed translation [2021-12-16 23:28:01,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01 WrapperNode [2021-12-16 23:28:01,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 23:28:01,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 23:28:01,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 23:28:01,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 23:28:01,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,649 INFO L137 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2021-12-16 23:28:01,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 23:28:01,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 23:28:01,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 23:28:01,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 23:28:01,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 23:28:01,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 23:28:01,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 23:28:01,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 23:28:01,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (1/1) ... [2021-12-16 23:28:01,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 23:28:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 23:28:01,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 23:28:01,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 23:28:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 23:28:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 23:28:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 23:28:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 23:28:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2021-12-16 23:28:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2021-12-16 23:28:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 23:28:01,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 23:28:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 23:28:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 23:28:01,786 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 23:28:01,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 23:28:01,894 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 23:28:01,898 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 23:28:01,898 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 23:28:01,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:28:01 BoogieIcfgContainer [2021-12-16 23:28:01,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 23:28:01,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 23:28:01,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 23:28:01,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 23:28:01,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:28:01" (1/3) ... [2021-12-16 23:28:01,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84154b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:28:01, skipping insertion in model container [2021-12-16 23:28:01,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:28:01" (2/3) ... [2021-12-16 23:28:01,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84154b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:28:01, skipping insertion in model container [2021-12-16 23:28:01,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:28:01" (3/3) ... [2021-12-16 23:28:01,905 INFO L111 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2021-12-16 23:28:01,909 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 23:28:01,909 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 23:28:01,976 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 23:28:01,981 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 23:28:01,982 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 23:28:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:28:02,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:02,006 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:02,007 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-16 23:28:02,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:02,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538591799] [2021-12-16 23:28:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:28:02,024 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:02,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:02,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:02,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 23:28:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:28:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-16 23:28:02,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 23:28:02,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:28:02,231 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:02,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538591799] [2021-12-16 23:28:02,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538591799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:28:02,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:28:02,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 23:28:02,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122425747] [2021-12-16 23:28:02,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:28:02,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 23:28:02,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:02,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 23:28:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:28:02,267 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:28:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:02,285 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-16 23:28:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 23:28:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-16 23:28:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:02,292 INFO L225 Difference]: With dead ends: 51 [2021-12-16 23:28:02,292 INFO L226 Difference]: Without dead ends: 23 [2021-12-16 23:28:02,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 23:28:02,298 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:02,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:28:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-16 23:28:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-16 23:28:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-16 23:28:02,326 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-16 23:28:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:02,326 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-16 23:28:02,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 23:28:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-16 23:28:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 23:28:02,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:02,329 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:02,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-16 23:28:02,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:02,535 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-16 23:28:02,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068510253] [2021-12-16 23:28:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:28:02,536 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:02,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:02,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:02,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 23:28:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:28:02,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:28:02,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:28:02,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:28:02,698 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:02,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068510253] [2021-12-16 23:28:02,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068510253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:28:02,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:28:02,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 23:28:02,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600035825] [2021-12-16 23:28:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:28:02,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 23:28:02,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 23:28:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:28:02,706 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:28:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:02,739 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-16 23:28:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 23:28:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-16 23:28:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:02,741 INFO L225 Difference]: With dead ends: 43 [2021-12-16 23:28:02,741 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 23:28:02,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 23:28:02,743 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:02,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:28:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 23:28:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 23:28:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-16 23:28:02,753 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-16 23:28:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:02,753 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-16 23:28:02,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:28:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-16 23:28:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 23:28:02,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:02,754 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:02,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 23:28:02,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:02,955 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-16 23:28:02,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:02,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167582290] [2021-12-16 23:28:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:28:02,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:02,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:02,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 23:28:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:28:02,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 23:28:03,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:28:03,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:28:03,181 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:03,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167582290] [2021-12-16 23:28:03,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167582290] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:03,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:03,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-16 23:28:03,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121560931] [2021-12-16 23:28:03,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:03,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 23:28:03,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 23:28:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:28:03,183 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:28:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:03,237 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-16 23:28:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 23:28:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2021-12-16 23:28:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:03,239 INFO L225 Difference]: With dead ends: 45 [2021-12-16 23:28:03,239 INFO L226 Difference]: Without dead ends: 27 [2021-12-16 23:28:03,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 23:28:03,240 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:03,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:28:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-16 23:28:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-16 23:28:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-16 23:28:03,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2021-12-16 23:28:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:03,244 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-16 23:28:03,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:28:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-16 23:28:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 23:28:03,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:03,245 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:03,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-16 23:28:03,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:03,452 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 64401422, now seen corresponding path program 2 times [2021-12-16 23:28:03,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190950589] [2021-12-16 23:28:03,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:28:03,453 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:03,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 23:28:03,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 23:28:03,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:03,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 23:28:03,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 23:28:03,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 23:28:03,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:03,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190950589] [2021-12-16 23:28:03,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190950589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 23:28:03,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 23:28:03,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 23:28:03,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463260028] [2021-12-16 23:28:03,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 23:28:03,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 23:28:03,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 23:28:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 23:28:03,555 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:28:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:03,590 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-16 23:28:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 23:28:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-16 23:28:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:03,591 INFO L225 Difference]: With dead ends: 45 [2021-12-16 23:28:03,591 INFO L226 Difference]: Without dead ends: 28 [2021-12-16 23:28:03,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 23:28:03,592 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:03,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 23:28:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-16 23:28:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-16 23:28:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 23:28:03,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2021-12-16 23:28:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:03,608 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 23:28:03,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 23:28:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-16 23:28:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 23:28:03,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:03,609 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:03,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-16 23:28:03,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:03,824 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-16 23:28:03,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:03,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012421885] [2021-12-16 23:28:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:28:03,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:03,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:03,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:03,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 23:28:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:28:03,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 23:28:03,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 23:28:04,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-16 23:28:04,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012421885] [2021-12-16 23:28:04,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012421885] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:04,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:04,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-16 23:28:04,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325920339] [2021-12-16 23:28:04,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:04,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 23:28:04,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:04,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 23:28:04,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-16 23:28:04,249 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:04,433 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-16 23:28:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 23:28:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2021-12-16 23:28:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:04,434 INFO L225 Difference]: With dead ends: 65 [2021-12-16 23:28:04,434 INFO L226 Difference]: Without dead ends: 52 [2021-12-16 23:28:04,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-12-16 23:28:04,435 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:04,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 23:28:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-16 23:28:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2021-12-16 23:28:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-16 23:28:04,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-16 23:28:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:04,441 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-16 23:28:04,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-16 23:28:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 23:28:04,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:04,442 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:04,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 23:28:04,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:04,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-16 23:28:04,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:04,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569395449] [2021-12-16 23:28:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 23:28:04,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:04,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:04,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 23:28:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:28:04,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-16 23:28:04,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:05,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:05,148 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:05,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-12-16 23:28:05,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:05,418 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:05,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2021-12-16 23:28:05,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:05,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:28:05,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:05,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2021-12-16 23:28:05,699 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:05,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2021-12-16 23:28:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 23:28:05,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:07,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-16 23:28:07,266 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:28:07,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2021-12-16 23:28:07,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 111 [2021-12-16 23:28:07,274 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:28:07,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 183 [2021-12-16 23:28:07,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-16 23:28:07,752 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-16 23:28:07,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2021-12-16 23:28:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 23:28:08,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569395449] [2021-12-16 23:28:08,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569395449] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:08,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:08,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-16 23:28:08,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97652837] [2021-12-16 23:28:08,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:08,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-16 23:28:08,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-16 23:28:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2021-12-16 23:28:08,037 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:28:10,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:28:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:13,001 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2021-12-16 23:28:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 23:28:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-16 23:28:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:13,005 INFO L225 Difference]: With dead ends: 87 [2021-12-16 23:28:13,005 INFO L226 Difference]: Without dead ends: 83 [2021-12-16 23:28:13,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=397, Invalid=2683, Unknown=0, NotChecked=0, Total=3080 [2021-12-16 23:28:13,006 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 97 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:13,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 233 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 678 Invalid, 1 Unknown, 66 Unchecked, 3.6s Time] [2021-12-16 23:28:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-16 23:28:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2021-12-16 23:28:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-16 23:28:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-16 23:28:13,030 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2021-12-16 23:28:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-16 23:28:13,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:28:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2021-12-16 23:28:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 23:28:13,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:13,033 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:13,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-16 23:28:13,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:13,241 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash 380877448, now seen corresponding path program 2 times [2021-12-16 23:28:13,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:13,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486790148] [2021-12-16 23:28:13,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:28:13,243 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:13,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:13,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:13,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 23:28:13,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:28:13,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:13,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 23:28:13,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:28:13,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:28:13,854 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486790148] [2021-12-16 23:28:13,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486790148] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:13,855 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:13,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-16 23:28:13,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057411144] [2021-12-16 23:28:13,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:13,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 23:28:13,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 23:28:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-16 23:28:13,856 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:28:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:14,165 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2021-12-16 23:28:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 23:28:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2021-12-16 23:28:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:14,167 INFO L225 Difference]: With dead ends: 104 [2021-12-16 23:28:14,167 INFO L226 Difference]: Without dead ends: 78 [2021-12-16 23:28:14,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:28:14,168 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:14,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 172 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:28:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-16 23:28:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2021-12-16 23:28:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:28:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-16 23:28:14,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2021-12-16 23:28:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:14,173 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-16 23:28:14,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:28:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-16 23:28:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 23:28:14,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:14,173 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:14,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-16 23:28:14,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:14,374 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1155110252, now seen corresponding path program 3 times [2021-12-16 23:28:14,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:14,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552852573] [2021-12-16 23:28:14,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 23:28:14,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:14,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 23:28:14,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-16 23:28:14,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:14,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 23:28:14,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:28:14,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:28:14,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552852573] [2021-12-16 23:28:14,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552852573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:14,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:14,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-16 23:28:14,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308301178] [2021-12-16 23:28:14,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:14,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 23:28:14,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 23:28:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-16 23:28:14,758 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:28:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:14,980 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-12-16 23:28:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 23:28:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2021-12-16 23:28:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:14,981 INFO L225 Difference]: With dead ends: 77 [2021-12-16 23:28:14,981 INFO L226 Difference]: Without dead ends: 58 [2021-12-16 23:28:14,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-16 23:28:14,982 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:14,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 125 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:28:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-16 23:28:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-16 23:28:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:28:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-16 23:28:14,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2021-12-16 23:28:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:14,986 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-16 23:28:14,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 23:28:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-12-16 23:28:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 23:28:14,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:14,987 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:15,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 23:28:15,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:15,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash -83406906, now seen corresponding path program 4 times [2021-12-16 23:28:15,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:15,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837346282] [2021-12-16 23:28:15,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 23:28:15,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:15,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:15,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 23:28:15,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 23:28:15,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:15,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 23:28:15,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:28:15,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-16 23:28:15,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837346282] [2021-12-16 23:28:15,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837346282] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:15,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:15,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-16 23:28:15,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021226308] [2021-12-16 23:28:15,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:15,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 23:28:15,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 23:28:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-16 23:28:15,727 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:15,921 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-16 23:28:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 23:28:15,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2021-12-16 23:28:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:15,922 INFO L225 Difference]: With dead ends: 64 [2021-12-16 23:28:15,922 INFO L226 Difference]: Without dead ends: 33 [2021-12-16 23:28:15,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-16 23:28:15,923 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:15,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:28:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-16 23:28:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-16 23:28:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:28:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-16 23:28:15,926 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2021-12-16 23:28:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:15,926 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-16 23:28:15,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-16 23:28:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 23:28:15,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:15,927 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:15,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-16 23:28:16,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:16,131 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1254464106, now seen corresponding path program 5 times [2021-12-16 23:28:16,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:16,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57659451] [2021-12-16 23:28:16,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 23:28:16,132 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:16,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:16,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 23:28:16,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-16 23:28:16,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:16,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:28:16,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 23:28:16,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-16 23:28:16,650 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:16,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57659451] [2021-12-16 23:28:16,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57659451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:16,651 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:16,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-12-16 23:28:16,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345813352] [2021-12-16 23:28:16,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:16,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 23:28:16,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 23:28:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-16 23:28:16,652 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:28:17,077 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-16 23:28:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 23:28:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2021-12-16 23:28:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:28:17,078 INFO L225 Difference]: With dead ends: 101 [2021-12-16 23:28:17,078 INFO L226 Difference]: Without dead ends: 82 [2021-12-16 23:28:17,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2021-12-16 23:28:17,079 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:28:17,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 152 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:28:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-16 23:28:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2021-12-16 23:28:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:28:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-12-16 23:28:17,085 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2021-12-16 23:28:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:28:17,085 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-12-16 23:28:17,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:28:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-12-16 23:28:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-16 23:28:17,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:28:17,086 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:28:17,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 23:28:17,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:28:17,294 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:28:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:28:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash 715974184, now seen corresponding path program 6 times [2021-12-16 23:28:17,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:28:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864166814] [2021-12-16 23:28:17,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 23:28:17,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:28:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:28:17,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:28:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 23:28:17,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-16 23:28:17,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:28:17,497 WARN L261 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-16 23:28:17,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:28:17,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:17,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:17,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:17,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:17,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2021-12-16 23:28:18,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:28:18,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:28:18,022 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:28:18,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2021-12-16 23:28:18,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,167 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:18,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2021-12-16 23:28:18,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:18,309 INFO L354 Elim1Store]: treesize reduction 72, result has 37.9 percent of original size [2021-12-16 23:28:18,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 81 [2021-12-16 23:28:19,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:19,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:28:19,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:28:19,385 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:28:19,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 85 [2021-12-16 23:28:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 23:28:19,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:28:40,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 252 [2021-12-16 23:28:40,046 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 23:28:40,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 411770 treesize of output 1 [2021-12-16 23:28:44,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 138 [2021-12-16 23:28:44,634 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-16 23:28:44,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42736 treesize of output 1 [2021-12-16 23:28:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-16 23:28:44,653 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:28:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864166814] [2021-12-16 23:28:44,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864166814] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:28:44,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:28:44,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 48 [2021-12-16 23:28:44,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973845761] [2021-12-16 23:28:44,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:28:44,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-16 23:28:44,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:28:44,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-16 23:28:44,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2058, Unknown=8, NotChecked=0, Total=2256 [2021-12-16 23:28:44,655 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:28:58,716 WARN L227 SmtUtils]: Spent 11.32s on a formula simplification. DAG size of input: 184 DAG size of output: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:29:01,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:03,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:05,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:12,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:14,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:17,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:29:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:29:40,269 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-16 23:29:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-16 23:29:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2021-12-16 23:29:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:29:40,271 INFO L225 Difference]: With dead ends: 91 [2021-12-16 23:29:40,271 INFO L226 Difference]: Without dead ends: 66 [2021-12-16 23:29:40,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 65.7s TimeCoverageRelationStatistics Valid=456, Invalid=4498, Unknown=16, NotChecked=0, Total=4970 [2021-12-16 23:29:40,273 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 84 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2021-12-16 23:29:40,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 121 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 652 Invalid, 6 Unknown, 238 Unchecked, 14.9s Time] [2021-12-16 23:29:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-16 23:29:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-12-16 23:29:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:29:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-16 23:29:40,280 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2021-12-16 23:29:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:29:40,280 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-16 23:29:40,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:29:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-16 23:29:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-16 23:29:40,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:29:40,281 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:29:40,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 23:29:40,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:29:40,497 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:29:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:29:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 598486502, now seen corresponding path program 7 times [2021-12-16 23:29:40,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:29:40,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753684625] [2021-12-16 23:29:40,498 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 23:29:40,498 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:29:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:29:40,499 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:29:40,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 23:29:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:29:40,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:29:40,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:29:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-16 23:29:40,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:29:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 23:29:41,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:29:41,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753684625] [2021-12-16 23:29:41,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753684625] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:29:41,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:29:41,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2021-12-16 23:29:41,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570430270] [2021-12-16 23:29:41,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:29:41,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 23:29:41,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:29:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 23:29:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-12-16 23:29:41,200 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:29:41,701 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2021-12-16 23:29:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 23:29:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2021-12-16 23:29:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:29:41,703 INFO L225 Difference]: With dead ends: 148 [2021-12-16 23:29:41,703 INFO L226 Difference]: Without dead ends: 103 [2021-12-16 23:29:41,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2021-12-16 23:29:41,704 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:29:41,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 194 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:29:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-16 23:29:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2021-12-16 23:29:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-16 23:29:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-12-16 23:29:41,720 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 53 [2021-12-16 23:29:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:29:41,721 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-12-16 23:29:41,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2021-12-16 23:29:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-16 23:29:41,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:29:41,722 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:29:41,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-16 23:29:41,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:29:41,922 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:29:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:29:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1840215844, now seen corresponding path program 8 times [2021-12-16 23:29:41,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:29:41,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484069658] [2021-12-16 23:29:41,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:29:41,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:29:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:29:41,925 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:29:41,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 23:29:42,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:29:42,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:29:42,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:29:42,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:29:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 23:29:42,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:29:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-16 23:29:42,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:29:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484069658] [2021-12-16 23:29:42,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484069658] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:29:42,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:29:42,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-16 23:29:42,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109639261] [2021-12-16 23:29:42,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:29:42,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 23:29:42,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:29:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 23:29:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:29:42,673 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:29:43,281 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-12-16 23:29:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 23:29:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2021-12-16 23:29:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:29:43,283 INFO L225 Difference]: With dead ends: 112 [2021-12-16 23:29:43,283 INFO L226 Difference]: Without dead ends: 66 [2021-12-16 23:29:43,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-12-16 23:29:43,284 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:29:43,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 114 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:29:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-16 23:29:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-12-16 23:29:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 23:29:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2021-12-16 23:29:43,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 55 [2021-12-16 23:29:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:29:43,289 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2021-12-16 23:29:43,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2021-12-16 23:29:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-16 23:29:43,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:29:43,290 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:29:43,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 23:29:43,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:29:43,498 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:29:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:29:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -740392824, now seen corresponding path program 9 times [2021-12-16 23:29:43,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:29:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094712226] [2021-12-16 23:29:43,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 23:29:43,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:29:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:29:43,500 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:29:43,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 23:29:43,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-16 23:29:43,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:29:43,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:29:43,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:29:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-16 23:29:43,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:29:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-16 23:29:44,269 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:29:44,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094712226] [2021-12-16 23:29:44,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094712226] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:29:44,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:29:44,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-12-16 23:29:44,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810178973] [2021-12-16 23:29:44,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:29:44,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 23:29:44,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:29:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 23:29:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-12-16 23:29:44,270 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:29:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:29:44,664 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-12-16 23:29:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 23:29:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2021-12-16 23:29:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:29:44,665 INFO L225 Difference]: With dead ends: 71 [2021-12-16 23:29:44,665 INFO L226 Difference]: Without dead ends: 40 [2021-12-16 23:29:44,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-16 23:29:44,667 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:29:44,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 93 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 23:29:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-16 23:29:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-16 23:29:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:29:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-16 23:29:44,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 55 [2021-12-16 23:29:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:29:44,670 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-16 23:29:44,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:29:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-16 23:29:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-16 23:29:44,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:29:44,671 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:29:44,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 23:29:44,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:29:44,871 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:29:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:29:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2073903416, now seen corresponding path program 10 times [2021-12-16 23:29:44,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:29:44,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21464451] [2021-12-16 23:29:44,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 23:29:44,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:29:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:29:44,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:29:44,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 23:29:44,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 23:29:44,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:29:44,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 23:29:44,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:29:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 58 proven. 20 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 23:29:45,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:29:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-16 23:29:45,985 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:29:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21464451] [2021-12-16 23:29:45,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21464451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:29:45,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:29:45,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-16 23:29:45,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159837114] [2021-12-16 23:29:45,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:29:45,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 23:29:45,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:29:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 23:29:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2021-12-16 23:29:45,986 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:29:46,947 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2021-12-16 23:29:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 23:29:46,948 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2021-12-16 23:29:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:29:46,949 INFO L225 Difference]: With dead ends: 94 [2021-12-16 23:29:46,949 INFO L226 Difference]: Without dead ends: 77 [2021-12-16 23:29:46,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=998, Unknown=0, NotChecked=0, Total=1332 [2021-12-16 23:29:46,950 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 187 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 23:29:46,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 23:29:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-16 23:29:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2021-12-16 23:29:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 64 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:29:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-12-16 23:29:46,955 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 59 [2021-12-16 23:29:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:29:46,955 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-12-16 23:29:46,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:29:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-12-16 23:29:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 23:29:46,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:29:46,956 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:29:46,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 23:29:47,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:29:47,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:29:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:29:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2140154630, now seen corresponding path program 11 times [2021-12-16 23:29:47,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:29:47,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712177769] [2021-12-16 23:29:47,157 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 23:29:47,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:29:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:29:47,158 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:29:47,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 23:29:47,527 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-16 23:29:47,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:29:47,539 WARN L261 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-16 23:29:47,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:29:47,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 23:29:48,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:48,208 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:29:48,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 49 [2021-12-16 23:29:51,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:51,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:51,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,474 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:29:51,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 89 [2021-12-16 23:29:51,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:51,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:51,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:51,882 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 23:29:51,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 97 [2021-12-16 23:29:52,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:52,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:52,279 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:29:52,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 89 [2021-12-16 23:29:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:29:52,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:29:52,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:29:52,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 78 [2021-12-16 23:29:53,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:29:53,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 43 [2021-12-16 23:29:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 7 proven. 118 refuted. 1 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 23:29:53,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:31:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 105 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 23:31:00,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:31:00,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712177769] [2021-12-16 23:31:00,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712177769] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:31:00,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:31:00,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41] total 76 [2021-12-16 23:31:00,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128857863] [2021-12-16 23:31:00,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:31:00,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-12-16 23:31:00,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:31:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-12-16 23:31:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=5203, Unknown=25, NotChecked=0, Total=5700 [2021-12-16 23:31:00,570 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 76 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 69 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:31:05,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:07,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:09,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:11,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:13,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:22,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:24,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:26,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:28,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:34,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:52,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:57,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:31:59,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:01,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:03,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:16,915 WARN L227 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 171 DAG size of output: 143 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:32:25,824 WARN L227 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 111 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:32:36,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:40,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:42,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:44,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:48,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:56,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:32:58,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:33:21,037 WARN L227 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 198 DAG size of output: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:33:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:23,239 INFO L93 Difference]: Finished difference Result 270 states and 347 transitions. [2021-12-16 23:33:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-12-16 23:33:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 69 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2021-12-16 23:33:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:23,247 INFO L225 Difference]: With dead ends: 270 [2021-12-16 23:33:23,247 INFO L226 Difference]: Without dead ends: 190 [2021-12-16 23:33:23,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 156.4s TimeCoverageRelationStatistics Valid=1154, Invalid=12158, Unknown=28, NotChecked=0, Total=13340 [2021-12-16 23:33:23,251 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 157 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 319 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 56.3s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:23,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 257 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1990 Invalid, 22 Unknown, 66 Unchecked, 56.3s Time] [2021-12-16 23:33:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-16 23:33:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 166. [2021-12-16 23:33:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 150 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2021-12-16 23:33:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2021-12-16 23:33:23,269 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 61 [2021-12-16 23:33:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:23,269 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2021-12-16 23:33:23,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 69 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:33:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2021-12-16 23:33:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 23:33:23,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:23,270 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:23,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:23,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:23,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash -573566332, now seen corresponding path program 12 times [2021-12-16 23:33:23,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:23,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990048941] [2021-12-16 23:33:23,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 23:33:23,481 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:23,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:23,482 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:23,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 23:33:23,649 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-12-16 23:33:23,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 23:33:23,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 97 proven. 18 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-12-16 23:33:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:33:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 95 proven. 18 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 23:33:24,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:33:24,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990048941] [2021-12-16 23:33:24,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990048941] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:33:24,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:33:24,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-12-16 23:33:24,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744644033] [2021-12-16 23:33:24,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:33:24,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-16 23:33:24,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:33:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 23:33:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2021-12-16 23:33:24,622 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:33:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:25,712 INFO L93 Difference]: Finished difference Result 272 states and 324 transitions. [2021-12-16 23:33:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 23:33:25,715 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2021-12-16 23:33:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:25,715 INFO L225 Difference]: With dead ends: 272 [2021-12-16 23:33:25,715 INFO L226 Difference]: Without dead ends: 184 [2021-12-16 23:33:25,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2021-12-16 23:33:25,716 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 109 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:25,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 128 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 23:33:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-16 23:33:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2021-12-16 23:33:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 149 states have (on average 1.1073825503355705) internal successors, (165), 150 states have internal predecessors, (165), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2021-12-16 23:33:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2021-12-16 23:33:25,728 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 67 [2021-12-16 23:33:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:25,728 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2021-12-16 23:33:25,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:33:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2021-12-16 23:33:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 23:33:25,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:25,729 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:25,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:25,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:25,938 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:25,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1153205594, now seen corresponding path program 13 times [2021-12-16 23:33:25,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:25,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612866942] [2021-12-16 23:33:25,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 23:33:25,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:25,947 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:25,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 23:33:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:33:26,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 23:33:26,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 70 proven. 34 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 23:33:26,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:33:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 70 proven. 34 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 23:33:27,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:33:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612866942] [2021-12-16 23:33:27,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612866942] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:33:27,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:33:27,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-12-16 23:33:27,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866701026] [2021-12-16 23:33:27,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:33:27,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-16 23:33:27,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:33:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-16 23:33:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-12-16 23:33:27,011 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:33:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:27,826 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2021-12-16 23:33:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-16 23:33:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2021-12-16 23:33:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:27,833 INFO L225 Difference]: With dead ends: 228 [2021-12-16 23:33:27,833 INFO L226 Difference]: Without dead ends: 201 [2021-12-16 23:33:27,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2021-12-16 23:33:27,834 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 336 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:27,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 211 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 23:33:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-16 23:33:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 124. [2021-12-16 23:33:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.0990990990990992) internal successors, (122), 112 states have internal predecessors, (122), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-16 23:33:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2021-12-16 23:33:27,869 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 69 [2021-12-16 23:33:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:27,869 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2021-12-16 23:33:27,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:33:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2021-12-16 23:33:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 23:33:27,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:27,870 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:27,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:28,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:28,079 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash 42167936, now seen corresponding path program 14 times [2021-12-16 23:33:28,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:28,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943634051] [2021-12-16 23:33:28,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:33:28,080 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:28,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:28,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:28,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 23:33:28,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:33:28,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:28,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 23:33:28,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 54 proven. 75 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-16 23:33:28,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:33:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 42 proven. 97 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-16 23:33:28,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:33:28,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943634051] [2021-12-16 23:33:28,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943634051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:33:28,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:33:28,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-16 23:33:28,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421328492] [2021-12-16 23:33:28,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:33:28,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 23:33:28,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:33:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 23:33:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-12-16 23:33:28,684 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:33:28,945 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2021-12-16 23:33:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 23:33:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2021-12-16 23:33:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:33:28,949 INFO L225 Difference]: With dead ends: 137 [2021-12-16 23:33:28,949 INFO L226 Difference]: Without dead ends: 106 [2021-12-16 23:33:28,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-12-16 23:33:28,949 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 72 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:33:28,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 80 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 23:33:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-16 23:33:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 78. [2021-12-16 23:33:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 70 states have internal predecessors, (75), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:33:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-12-16 23:33:28,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 71 [2021-12-16 23:33:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:33:28,965 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-12-16 23:33:28,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:33:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-12-16 23:33:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 23:33:28,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:33:28,971 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:33:28,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-16 23:33:29,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:33:29,180 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:33:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:33:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash 961678948, now seen corresponding path program 15 times [2021-12-16 23:33:29,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:33:29,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858222610] [2021-12-16 23:33:29,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 23:33:29,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:33:29,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:33:29,186 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:33:29,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 23:33:29,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-16 23:33:29,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:33:29,965 WARN L261 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-16 23:33:29,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:33:30,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:30,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:30,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 61 [2021-12-16 23:33:31,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:31,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:31,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,495 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:33:31,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 104 [2021-12-16 23:33:31,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:31,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:31,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:31,830 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:33:31,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 104 [2021-12-16 23:33:32,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:32,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:32,161 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:33:32,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 104 [2021-12-16 23:33:32,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:32,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 81 [2021-12-16 23:33:32,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:32,836 INFO L354 Elim1Store]: treesize reduction 124, result has 37.4 percent of original size [2021-12-16 23:33:32,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 123 [2021-12-16 23:33:36,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:36,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:33:36,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:36,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:33:36,952 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:33:36,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 133 [2021-12-16 23:33:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 26 proven. 184 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 23:33:37,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:34:38,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 121 [2021-12-16 23:34:38,815 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-16 23:34:38,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40030 treesize of output 1 [2021-12-16 23:34:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 6 proven. 178 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-16 23:34:43,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:34:43,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858222610] [2021-12-16 23:34:43,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858222610] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:34:43,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:34:43,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 36] total 76 [2021-12-16 23:34:43,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751202724] [2021-12-16 23:34:43,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:34:43,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-12-16 23:34:43,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:34:43,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-12-16 23:34:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=5373, Unknown=20, NotChecked=0, Total=5700 [2021-12-16 23:34:43,955 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 76 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 68 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:36:33,845 WARN L227 SmtUtils]: Spent 1.71m on a formula simplification. DAG size of input: 335 DAG size of output: 282 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:36:38,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:36:40,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:36:44,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:36:46,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:36:52,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:36:54,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:37:01,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:37:03,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:38:24,546 WARN L227 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 206 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:38:27,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:38:55,625 WARN L227 SmtUtils]: Spent 22.47s on a formula simplification. DAG size of input: 121 DAG size of output: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:38:57,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:00,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:02,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:04,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:06,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:29,681 WARN L227 SmtUtils]: Spent 16.71s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:39:31,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:39:53,801 WARN L227 SmtUtils]: Spent 16.60s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 23:40:00,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:40:06,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-16 23:40:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:40:39,825 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2021-12-16 23:40:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-12-16 23:40:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 68 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 71 [2021-12-16 23:40:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:40:39,828 INFO L225 Difference]: With dead ends: 161 [2021-12-16 23:40:39,828 INFO L226 Difference]: Without dead ends: 155 [2021-12-16 23:40:39,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3189 ImplicationChecksByTransitivity, 376.0s TimeCoverageRelationStatistics Valid=588, Invalid=9276, Unknown=36, NotChecked=0, Total=9900 [2021-12-16 23:40:39,830 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 81 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 111 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 48.4s IncrementalHoareTripleChecker+Time [2021-12-16 23:40:39,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 293 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1876 Invalid, 16 Unknown, 435 Unchecked, 48.4s Time] [2021-12-16 23:40:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-16 23:40:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2021-12-16 23:40:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 116 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2021-12-16 23:40:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2021-12-16 23:40:39,840 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 71 [2021-12-16 23:40:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:40:39,840 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2021-12-16 23:40:39,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 68 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:40:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2021-12-16 23:40:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 23:40:39,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:40:39,842 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:40:39,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 23:40:40,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:40:40,053 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:40:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:40:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1846192802, now seen corresponding path program 16 times [2021-12-16 23:40:40,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:40:40,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788476348] [2021-12-16 23:40:40,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 23:40:40,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:40:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:40:40,055 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:40:40,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 23:40:40,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 23:40:40,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:40:40,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 23:40:40,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:40:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 23:40:40,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:40:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-16 23:40:41,408 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:40:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788476348] [2021-12-16 23:40:41,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788476348] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:40:41,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:40:41,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2021-12-16 23:40:41,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351382064] [2021-12-16 23:40:41,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:40:41,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-16 23:40:41,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:40:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-16 23:40:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-12-16 23:40:41,411 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:40:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:40:43,259 INFO L93 Difference]: Finished difference Result 230 states and 275 transitions. [2021-12-16 23:40:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-16 23:40:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2021-12-16 23:40:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:40:43,263 INFO L225 Difference]: With dead ends: 230 [2021-12-16 23:40:43,263 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 23:40:43,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=1513, Unknown=0, NotChecked=0, Total=1892 [2021-12-16 23:40:43,264 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 242 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 23:40:43,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 391 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 23:40:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 23:40:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 109. [2021-12-16 23:40:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 99 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-16 23:40:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-12-16 23:40:43,292 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 73 [2021-12-16 23:40:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:40:43,292 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-12-16 23:40:43,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 31 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 23:40:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-12-16 23:40:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-16 23:40:43,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:40:43,293 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:40:43,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-16 23:40:43,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:40:43,503 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:40:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:40:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 145446980, now seen corresponding path program 17 times [2021-12-16 23:40:43,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:40:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374850662] [2021-12-16 23:40:43,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 23:40:43,504 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:40:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:40:43,505 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:40:43,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-16 23:40:44,106 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-12-16 23:40:44,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:40:44,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 23:40:44,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:40:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 93 proven. 52 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-12-16 23:40:44,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:40:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 44 proven. 105 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-12-16 23:40:45,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:40:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374850662] [2021-12-16 23:40:45,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374850662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:40:45,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:40:45,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2021-12-16 23:40:45,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288999226] [2021-12-16 23:40:45,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:40:45,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-16 23:40:45,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:40:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-16 23:40:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-12-16 23:40:45,192 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:40:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:40:48,309 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2021-12-16 23:40:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-16 23:40:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2021-12-16 23:40:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:40:48,313 INFO L225 Difference]: With dead ends: 306 [2021-12-16 23:40:48,313 INFO L226 Difference]: Without dead ends: 206 [2021-12-16 23:40:48,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2021-12-16 23:40:48,314 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 336 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 23:40:48,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 407 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 23:40:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-16 23:40:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 86. [2021-12-16 23:40:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-16 23:40:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2021-12-16 23:40:48,347 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 75 [2021-12-16 23:40:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:40:48,347 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2021-12-16 23:40:48,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:40:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2021-12-16 23:40:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 23:40:48,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:40:48,348 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:40:48,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-16 23:40:48,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:40:48,553 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:40:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:40:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1455314524, now seen corresponding path program 18 times [2021-12-16 23:40:48,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:40:48,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048568436] [2021-12-16 23:40:48,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 23:40:48,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:40:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:40:48,559 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:40:48,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-16 23:40:49,029 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-12-16 23:40:49,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:40:49,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 23:40:49,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:40:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 90 proven. 68 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-16 23:40:49,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:40:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 28 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-16 23:40:50,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:40:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048568436] [2021-12-16 23:40:50,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048568436] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:40:50,775 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:40:50,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2021-12-16 23:40:50,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335598735] [2021-12-16 23:40:50,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:40:50,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-16 23:40:50,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:40:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-16 23:40:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2021-12-16 23:40:50,777 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:40:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:40:53,544 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2021-12-16 23:40:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-16 23:40:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 79 [2021-12-16 23:40:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:40:53,546 INFO L225 Difference]: With dead ends: 138 [2021-12-16 23:40:53,547 INFO L226 Difference]: Without dead ends: 75 [2021-12-16 23:40:53,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=458, Invalid=1704, Unknown=0, NotChecked=0, Total=2162 [2021-12-16 23:40:53,547 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 127 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 23:40:53,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 215 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 23:40:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-16 23:40:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2021-12-16 23:40:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 63 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-16 23:40:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2021-12-16 23:40:53,554 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 79 [2021-12-16 23:40:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:40:53,555 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2021-12-16 23:40:53,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 23:40:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2021-12-16 23:40:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 23:40:53,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:40:53,556 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:40:53,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-16 23:40:53,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:40:53,756 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:40:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:40:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1128801028, now seen corresponding path program 19 times [2021-12-16 23:40:53,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:40:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230649778] [2021-12-16 23:40:53,757 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 23:40:53,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:40:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:40:53,758 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:40:53,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-16 23:40:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 23:40:53,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 23:40:53,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:40:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 130 proven. 52 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-12-16 23:40:54,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 23:40:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2021-12-16 23:40:56,537 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 23:40:56,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230649778] [2021-12-16 23:40:56,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230649778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 23:40:56,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 23:40:56,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2021-12-16 23:40:56,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69403427] [2021-12-16 23:40:56,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 23:40:56,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-16 23:40:56,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 23:40:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-16 23:40:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2021-12-16 23:40:56,538 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:40:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 23:40:57,793 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2021-12-16 23:40:57,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-16 23:40:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2021-12-16 23:40:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 23:40:57,794 INFO L225 Difference]: With dead ends: 143 [2021-12-16 23:40:57,794 INFO L226 Difference]: Without dead ends: 122 [2021-12-16 23:40:57,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=529, Invalid=1727, Unknown=0, NotChecked=0, Total=2256 [2021-12-16 23:40:57,795 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 237 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 23:40:57,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 173 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-16 23:40:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-16 23:40:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 67. [2021-12-16 23:40:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 23:40:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-12-16 23:40:57,802 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 79 [2021-12-16 23:40:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 23:40:57,802 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-12-16 23:40:57,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-16 23:40:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-12-16 23:40:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-16 23:40:57,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 23:40:57,803 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 23:40:57,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-16 23:40:58,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 23:40:58,013 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 23:40:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 23:40:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -111611838, now seen corresponding path program 20 times [2021-12-16 23:40:58,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 23:40:58,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147327942] [2021-12-16 23:40:58,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 23:40:58,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 23:40:58,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 23:40:58,018 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 23:40:58,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-16 23:40:58,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 23:40:58,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 23:40:58,693 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-16 23:40:58,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 23:40:58,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 23:41:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:00,541 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:41:00,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 73 [2021-12-16 23:41:01,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:01,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,519 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:41:01,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 140 treesize of output 119 [2021-12-16 23:41:01,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:01,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:01,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:01,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,009 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 23:41:02,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 122 [2021-12-16 23:41:02,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,486 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 23:41:02,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 119 [2021-12-16 23:41:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:02,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:02,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:03,004 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 23:41:03,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 138 treesize of output 122 [2021-12-16 23:41:03,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,552 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:41:03,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 96 [2021-12-16 23:41:03,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:03,960 INFO L354 Elim1Store]: treesize reduction 150, result has 37.2 percent of original size [2021-12-16 23:41:03,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 128 treesize of output 144 [2021-12-16 23:41:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:14,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:14,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:14,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:14,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 23:41:14,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 23:41:15,008 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 23:41:15,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 250 treesize of output 157 [2021-12-16 23:41:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 26 proven. 286 refuted. 4 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 23:41:17,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15