./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-fpi/sina1.c -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 b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:56:52,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:56:52,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:56:52,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:56:52,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:56:52,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:56:52,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:56:52,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:56:52,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:56:52,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:56:52,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:56:52,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:56:52,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:56:52,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:56:52,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:56:52,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:56:52,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:56:52,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:56:52,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:56:52,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:56:52,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:56:52,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:56:52,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:56:52,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:56:52,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:56:52,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:56:52,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:56:52,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:56:52,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:56:52,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:56:52,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:56:52,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:56:52,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:56:52,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:56:52,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:56:52,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:56:52,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:56:52,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:56:52,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:56:52,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:56:52,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:56:52,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:56:52,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:56:52,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:56:52,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:56:52,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:56:52,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:56:52,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:56:52,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:56:52,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:56:52,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:56:52,685 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:56:52,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:56:52,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:56:52,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:56:52,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:56:52,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:56:52,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:56:52,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:56:52,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:56:52,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:56:52,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:56:52,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:56:52,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:56:52,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:56:52,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:56:52,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:56:52,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:56:52,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:56:52,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:56:52,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:56:52,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:56:52,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:56:52,690 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:56:52,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:56:52,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:56:52,691 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 -> b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf [2022-07-22 10:56:52,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:56:52,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:56:52,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:56:52,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:56:52,995 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:56:52,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina1.c [2022-07-22 10:56:53,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc459a8e5/f599cb1ef9f04c72a17e64928c775f43/FLAG7773c8672 [2022-07-22 10:56:53,500 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:56:53,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1.c [2022-07-22 10:56:53,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc459a8e5/f599cb1ef9f04c72a17e64928c775f43/FLAG7773c8672 [2022-07-22 10:56:53,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc459a8e5/f599cb1ef9f04c72a17e64928c775f43 [2022-07-22 10:56:53,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:56:53,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:56:53,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:56:53,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:56:53,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:56:53,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:56:53" (1/1) ... [2022-07-22 10:56:53,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702cbb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:53, skipping insertion in model container [2022-07-22 10:56:53,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:56:53" (1/1) ... [2022-07-22 10:56:53,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:56:53,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:56:54,046 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-fpi/sina1.c[588,601] [2022-07-22 10:56:54,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:56:54,067 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:56:54,076 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-fpi/sina1.c[588,601] [2022-07-22 10:56:54,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:56:54,092 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:56:54,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54 WrapperNode [2022-07-22 10:56:54,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:56:54,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:56:54,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:56:54,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:56:54,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,158 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-07-22 10:56:54,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:56:54,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:56:54,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:56:54,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:56:54,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:56:54,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:56:54,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:56:54,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:56:54,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (1/1) ... [2022-07-22 10:56:54,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:56:54,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:54,213 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) [2022-07-22 10:56:54,220 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 [2022-07-22 10:56:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:56:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:56:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:56:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:56:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:56:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:56:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:56:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:56:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:56:54,293 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:56:54,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:56:54,403 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:56:54,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:56:54,412 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:56:54,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:56:54 BoogieIcfgContainer [2022-07-22 10:56:54,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:56:54,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:56:54,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:56:54,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:56:54,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:56:53" (1/3) ... [2022-07-22 10:56:54,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b540b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:56:54, skipping insertion in model container [2022-07-22 10:56:54,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:54" (2/3) ... [2022-07-22 10:56:54,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b540b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:56:54, skipping insertion in model container [2022-07-22 10:56:54,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:56:54" (3/3) ... [2022-07-22 10:56:54,434 INFO L111 eAbstractionObserver]: Analyzing ICFG sina1.c [2022-07-22 10:56:54,445 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:56:54,459 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:56:54,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:56:54,537 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f6d4a6d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24c66fb1 [2022-07-22 10:56:54,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:56:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:56:54,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:54,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:54,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-22 10:56:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623815447] [2022-07-22 10:56:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623815447] [2022-07-22 10:56:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623815447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:56:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:56:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:56:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014369068] [2022-07-22 10:56:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:56:54,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:56:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:56:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:56:54,745 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:54,761 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-22 10:56:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:56:54,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:56:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:54,770 INFO L225 Difference]: With dead ends: 38 [2022-07-22 10:56:54,771 INFO L226 Difference]: Without dead ends: 17 [2022-07-22 10:56:54,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:56:54,777 INFO L413 NwaCegarLoop]: 24 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, 24 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 [2022-07-22 10:56:54,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-22 10:56:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-22 10:56:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-22 10:56:54,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-22 10:56:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:54,809 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-22 10:56:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-22 10:56:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:56:54,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:54,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:54,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:56:54,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-22 10:56:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:54,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009163741] [2022-07-22 10:56:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009163741] [2022-07-22 10:56:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009163741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:56:54,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:56:54,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:56:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096096559] [2022-07-22 10:56:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:56:54,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:56:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:56:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:56:54,921 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:54,965 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-22 10:56:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:56:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:56:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:54,967 INFO L225 Difference]: With dead ends: 37 [2022-07-22 10:56:54,967 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 10:56:54,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:56:54,969 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:54,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 10:56:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-22 10:56:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-22 10:56:54,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-07-22 10:56:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:54,975 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 10:56:54,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-22 10:56:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:56:54,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:54,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:54,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:56:54,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-22 10:56:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238372796] [2022-07-22 10:56:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:55,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238372796] [2022-07-22 10:56:55,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238372796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:55,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953604849] [2022-07-22 10:56:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:55,381 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) [2022-07-22 10:56:55,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:56:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:55,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:56:55,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:55,535 INFO L390 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 11 treesize of output 7 [2022-07-22 10:56:55,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:56:55,699 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 10:56:55,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-22 10:56:55,797 INFO L390 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 32 treesize of output 20 [2022-07-22 10:56:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:55,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:04,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953604849] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:04,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:04,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-07-22 10:57:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453959445] [2022-07-22 10:57:04,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:04,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 10:57:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 10:57:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=335, Unknown=4, NotChecked=0, Total=420 [2022-07-22 10:57:04,058 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:04,515 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-07-22 10:57:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 10:57:04,515 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:57:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:04,516 INFO L225 Difference]: With dead ends: 41 [2022-07-22 10:57:04,516 INFO L226 Difference]: Without dead ends: 39 [2022-07-22 10:57:04,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=259, Invalid=793, Unknown=4, NotChecked=0, Total=1056 [2022-07-22 10:57:04,518 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:04,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 99 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 190 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-07-22 10:57:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-22 10:57:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-07-22 10:57:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-22 10:57:04,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-22 10:57:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:04,525 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-22 10:57:04,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-22 10:57:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 10:57:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:04,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:04,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:57:04,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:04,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 2 times [2022-07-22 10:57:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290978136] [2022-07-22 10:57:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290978136] [2022-07-22 10:57:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290978136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631835875] [2022-07-22 10:57:04,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:57:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:04,822 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) [2022-07-22 10:57:04,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:57:04,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:57:04,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:04,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:04,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:04,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631835875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:04,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230723008] [2022-07-22 10:57:04,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:04,972 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:05,101 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-07-22 10:57:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 10:57:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:05,102 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:57:05,102 INFO L226 Difference]: Without dead ends: 51 [2022-07-22 10:57:05,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:57:05,104 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:05,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 81 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-22 10:57:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2022-07-22 10:57:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-22 10:57:05,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-07-22 10:57:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:05,110 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-22 10:57:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-22 10:57:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:57:05,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:05,111 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:05,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:57:05,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:57:05,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2022-07-22 10:57:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:05,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707006445] [2022-07-22 10:57:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707006445] [2022-07-22 10:57:05,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707006445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:05,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900735656] [2022-07-22 10:57:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:05,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:57:05,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:57:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:05,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:05,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:05,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:57:05,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900735656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:05,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:05,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111152949] [2022-07-22 10:57:05,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:05,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:05,550 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:05,623 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-07-22 10:57:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:57:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:05,626 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:57:05,626 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 10:57:05,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:57:05,628 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:05,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:57:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 10:57:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2022-07-22 10:57:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-22 10:57:05,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2022-07-22 10:57:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:05,636 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-22 10:57:05,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-22 10:57:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:57:05,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:05,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:05,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:57:05,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:05,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 3 times [2022-07-22 10:57:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:05,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215915725] [2022-07-22 10:57:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:06,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215915725] [2022-07-22 10:57:06,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215915725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:06,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419311492] [2022-07-22 10:57:06,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:57:06,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:06,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:06,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:57:06,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:57:06,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:57:06,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:06,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:57:06,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:06,269 INFO L390 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 11 treesize of output 7 [2022-07-22 10:57:06,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:57:06,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:57:06,480 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 10:57:06,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-22 10:57:06,541 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:57:06,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-07-22 10:57:06,674 INFO L390 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 32 treesize of output 20 [2022-07-22 10:57:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:06,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419311492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:51,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:51,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 37 [2022-07-22 10:57:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535643206] [2022-07-22 10:57:51,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:51,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-22 10:57:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-22 10:57:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1149, Unknown=17, NotChecked=0, Total=1332 [2022-07-22 10:57:51,134 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:59,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_130 Int)) (= c_~N~0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (<= c_~N~0 .cse0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:58:01,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_130 Int)) (= c_~N~0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= .cse0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 .cse0))) is different from false [2022-07-22 10:58:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:02,606 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-07-22 10:58:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-22 10:58:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:58:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:02,607 INFO L225 Difference]: With dead ends: 77 [2022-07-22 10:58:02,607 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 10:58:02,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=483, Invalid=3166, Unknown=19, NotChecked=238, Total=3906 [2022-07-22 10:58:02,611 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 115 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:02,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 237 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 228 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2022-07-22 10:58:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 10:58:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 36. [2022-07-22 10:58:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-22 10:58:02,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2022-07-22 10:58:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:02,629 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 10:58:02,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-22 10:58:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:58:02,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:02,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:58:02,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:58:02,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:02,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 2 times [2022-07-22 10:58:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376079774] [2022-07-22 10:58:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:58:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:03,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376079774] [2022-07-22 10:58:03,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376079774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:03,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686264757] [2022-07-22 10:58:03,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:58:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:03,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:58:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:58:03,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:58:03,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:03,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 10:58:03,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:03,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-07-22 10:58:03,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:58:03,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-07-22 10:58:03,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:03,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-22 10:58:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:58:03,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:58:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:58:04,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686264757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:58:04,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:58:04,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 34 [2022-07-22 10:58:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473646803] [2022-07-22 10:58:04,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:58:04,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 10:58:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:58:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 10:58:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 10:58:04,115 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:07,455 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-07-22 10:58:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-22 10:58:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:58:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:07,456 INFO L225 Difference]: With dead ends: 98 [2022-07-22 10:58:07,456 INFO L226 Difference]: Without dead ends: 96 [2022-07-22 10:58:07,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=645, Invalid=3777, Unknown=0, NotChecked=0, Total=4422 [2022-07-22 10:58:07,458 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 148 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:07,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 167 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 392 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2022-07-22 10:58:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-22 10:58:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 47. [2022-07-22 10:58:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-22 10:58:07,473 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2022-07-22 10:58:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:07,473 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-22 10:58:07,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-22 10:58:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:58:07,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:07,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:58:07,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 10:58:07,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:07,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 4 times [2022-07-22 10:58:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:07,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202291530] [2022-07-22 10:58:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:58:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202291530] [2022-07-22 10:58:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202291530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340796058] [2022-07-22 10:58:08,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:58:08,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:08,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:58:08,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:58:08,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:58:08,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:08,316 WARN L261 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-22 10:58:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:08,327 INFO L390 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 11 treesize of output 7 [2022-07-22 10:58:08,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:58:08,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:58:08,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2022-07-22 10:58:08,553 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-22 10:58:08,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-07-22 10:58:08,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:08,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 10:58:08,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:58:08,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 10:58:08,740 INFO L390 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 39 treesize of output 23 [2022-07-22 10:58:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:58:08,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:58:27,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-07-22 10:58:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-07-22 10:58:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340796058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:58:51,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:58:51,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 39 [2022-07-22 10:58:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852273305] [2022-07-22 10:58:51,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:58:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 10:58:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:58:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 10:58:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1239, Unknown=17, NotChecked=72, Total=1482 [2022-07-22 10:58:51,849 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:21,515 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse0 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_219 Int) (v_ArrVal_216 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= c_~N~0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_216) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ c_~N~0 (- 3)) 0) (<= 3 .cse0))) is different from false [2022-07-22 10:59:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:23,737 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-22 10:59:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 10:59:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:59:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:23,738 INFO L225 Difference]: With dead ends: 106 [2022-07-22 10:59:23,738 INFO L226 Difference]: Without dead ends: 104 [2022-07-22 10:59:23,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 75.0s TimeCoverageRelationStatistics Valid=272, Invalid=2461, Unknown=31, NotChecked=206, Total=2970 [2022-07-22 10:59:23,740 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 175 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 179 Unchecked, 0.1s Time] [2022-07-22 10:59:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-22 10:59:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 62. [2022-07-22 10:59:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-07-22 10:59:23,751 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 24 [2022-07-22 10:59:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:23,751 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-07-22 10:59:23,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-07-22 10:59:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:59:23,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:23,753 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:23,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:59:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:23,967 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 3 times [2022-07-22 10:59:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616715198] [2022-07-22 10:59:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:59:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616715198] [2022-07-22 10:59:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616715198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755150525] [2022-07-22 10:59:24,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:59:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:24,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:59:24,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:59:24,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:59:24,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:59:24,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:59:24,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:59:24,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:59:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:59:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755150525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:59:24,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:59:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:59:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716637947] [2022-07-22 10:59:24,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:59:24,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:59:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:59:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:59:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:59:24,239 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:24,331 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-07-22 10:59:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:59:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 10:59:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:24,332 INFO L225 Difference]: With dead ends: 108 [2022-07-22 10:59:24,332 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 10:59:24,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:59:24,333 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:24,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 52 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:59:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 10:59:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-07-22 10:59:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-07-22 10:59:24,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 28 [2022-07-22 10:59:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:24,354 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-07-22 10:59:24,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-07-22 10:59:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:59:24,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:24,358 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:24,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:59:24,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:24,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 778799246, now seen corresponding path program 5 times [2022-07-22 10:59:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176211900] [2022-07-22 10:59:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176211900] [2022-07-22 10:59:25,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176211900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469441578] [2022-07-22 10:59:25,172 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:59:25,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:25,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:25,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:59:25,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:59:25,251 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:59:25,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:59:25,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-22 10:59:25,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:25,261 INFO L390 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 11 treesize of output 7 [2022-07-22 10:59:25,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:59:25,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2022-07-22 10:59:25,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2022-07-22 10:59:25,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 10:59:25,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:25,468 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 10:59:25,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-22 10:59:25,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:25,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-22 10:59:25,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:25,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-22 10:59:25,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:25,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:59:25,779 INFO L390 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 32 treesize of output 20 [2022-07-22 10:59:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:25,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:00:23,976 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:00:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:00:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469441578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:00:26,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:00:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 19] total 54 [2022-07-22 11:00:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554899748] [2022-07-22 11:00:26,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:00:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-22 11:00:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:00:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-22 11:00:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2618, Unknown=16, NotChecked=0, Total=2862 [2022-07-22 11:00:26,178 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:00:30,485 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-07-22 11:00:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-22 11:00:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 11:00:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:00:30,486 INFO L225 Difference]: With dead ends: 123 [2022-07-22 11:00:30,486 INFO L226 Difference]: Without dead ends: 107 [2022-07-22 11:00:30,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=1017, Invalid=8472, Unknown=17, NotChecked=0, Total=9506 [2022-07-22 11:00:30,488 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 190 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:00:30,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 418 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 719 Invalid, 0 Unknown, 287 Unchecked, 0.4s Time] [2022-07-22 11:00:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-22 11:00:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 52. [2022-07-22 11:00:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-07-22 11:00:30,498 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 28 [2022-07-22 11:00:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:00:30,498 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-07-22 11:00:30,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-07-22 11:00:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 11:00:30,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:00:30,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:00:30,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 11:00:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 11:00:30,700 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:00:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:00:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1146912830, now seen corresponding path program 4 times [2022-07-22 11:00:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:00:30,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128708295] [2022-07-22 11:00:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:00:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:00:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:00:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:00:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:00:31,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128708295] [2022-07-22 11:00:31,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128708295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:00:31,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620388897] [2022-07-22 11:00:31,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 11:00:31,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:00:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:00:31,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:00:31,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 11:00:31,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 11:00:31,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:00:31,284 WARN L261 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 11:00:31,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:00:31,304 INFO L390 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 11 treesize of output 7 [2022-07-22 11:00:31,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 11:00:31,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2022-07-22 11:00:31,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-07-22 11:00:31,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:31,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-22 11:00:31,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:31,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:31,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-22 11:00:31,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:31,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:31,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-22 11:00:32,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:00:32,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2022-07-22 11:00:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:00:32,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:00:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 11:00:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620388897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:00:32,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:00:32,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-07-22 11:00:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749789403] [2022-07-22 11:00:32,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:00:32,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 11:00:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:00:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 11:00:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2265, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 11:00:32,952 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:00:34,089 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-07-22 11:00:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-22 11:00:34,089 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:00:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:00:34,090 INFO L225 Difference]: With dead ends: 103 [2022-07-22 11:00:34,090 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 11:00:34,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=635, Invalid=5371, Unknown=0, NotChecked=0, Total=6006 [2022-07-22 11:00:34,092 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:00:34,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 203 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 264 Invalid, 0 Unknown, 168 Unchecked, 0.2s Time] [2022-07-22 11:00:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 11:00:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2022-07-22 11:00:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2022-07-22 11:00:34,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 32 [2022-07-22 11:00:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:00:34,110 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2022-07-22 11:00:34,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-07-22 11:00:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 11:00:34,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:00:34,111 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:00:34,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 11:00:34,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:00:34,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:00:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:00:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698556, now seen corresponding path program 5 times [2022-07-22 11:00:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:00:34,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113094330] [2022-07-22 11:00:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:00:34,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:00:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:00:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 11:00:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:00:34,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113094330] [2022-07-22 11:00:34,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113094330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:00:34,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45995664] [2022-07-22 11:00:34,415 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 11:00:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:00:34,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:00:34,416 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:00:34,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 11:00:34,486 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 11:00:34,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:00:34,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 11:00:34,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:00:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 11:00:34,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:00:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 11:00:34,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45995664] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:00:34,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:00:34,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-22 11:00:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332659661] [2022-07-22 11:00:34,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:00:34,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 11:00:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:00:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 11:00:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-22 11:00:34,640 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:00:34,853 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-07-22 11:00:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 11:00:34,853 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:00:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:00:34,854 INFO L225 Difference]: With dead ends: 151 [2022-07-22 11:00:34,854 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 11:00:34,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2022-07-22 11:00:34,855 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 205 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:00:34,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 110 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:00:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 11:00:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-07-22 11:00:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-07-22 11:00:34,868 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 32 [2022-07-22 11:00:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:00:34,868 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-07-22 11:00:34,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-07-22 11:00:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 11:00:34,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:00:34,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:00:34,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 11:00:35,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 11:00:35,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:00:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:00:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1226631488, now seen corresponding path program 6 times [2022-07-22 11:00:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:00:35,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135010776] [2022-07-22 11:00:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:00:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:00:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:00:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:00:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:00:35,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135010776] [2022-07-22 11:00:35,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135010776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:00:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925386495] [2022-07-22 11:00:35,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 11:00:35,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:00:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:00:35,739 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:00:35,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 11:00:35,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 11:00:35,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:00:35,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-22 11:00:35,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:00:35,839 INFO L390 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 11 treesize of output 7 [2022-07-22 11:00:35,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-07-22 11:00:35,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 11:00:35,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-22 11:00:35,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-22 11:00:36,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 11:00:36,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 11:00:36,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 11:00:36,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-22 11:00:36,373 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 11:00:36,373 INFO L390 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 32 treesize of output 34 [2022-07-22 11:00:36,439 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 11:00:36,439 INFO L390 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 32 treesize of output 34 [2022-07-22 11:00:36,512 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 11:00:36,512 INFO L390 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 32 treesize of output 34 [2022-07-22 11:00:36,846 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 11:00:36,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 29 [2022-07-22 11:00:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:00:36,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:01:11,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (store (store (store (store v_ArrVal_480 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_152| 4)) v_ArrVal_483) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)) v_ArrVal_485) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (let ((.cse0 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse0) (not (< |v_ULTIMATE.start_main_~i~0#1_150| .cse0)) (= .cse0 (select .cse1 .cse2))))))) is different from false [2022-07-22 11:01:11,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (store (store (store (store v_ArrVal_480 .cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_152| 4)) v_ArrVal_483) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)) v_ArrVal_485) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (let ((.cse0 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (= .cse0 (select .cse1 .cse2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (< |v_ULTIMATE.start_main_~i~0#1_150| .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|))))))) is different from false [2022-07-22 11:01:11,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (store (store (store (store v_ArrVal_480 .cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_152| 4)) v_ArrVal_483) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)) v_ArrVal_485) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (let ((.cse0 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (< |v_ULTIMATE.start_main_~i~0#1_150| .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (= (select .cse1 .cse2) .cse0)))))) is different from false [2022-07-22 11:01:12,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (store (store (store (store v_ArrVal_480 .cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_152| 4)) v_ArrVal_483) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)) v_ArrVal_485) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (let ((.cse0 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< |v_ULTIMATE.start_main_~i~0#1_150| .cse0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (= .cse0 (select .cse1 .cse2)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|))))))) is different from false [2022-07-22 11:01:12,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_487 Int) (v_ArrVal_485 Int) (v_ArrVal_483 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (store (store (store (store v_ArrVal_480 .cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 5)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_152| 4)) v_ArrVal_483) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)) v_ArrVal_485) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (let ((.cse0 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_152|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (= .cse0 (select .cse1 .cse2)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (not (< |v_ULTIMATE.start_main_~i~0#1_150| .cse0))))))) is different from false [2022-07-22 11:01:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 29 refuted. 8 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-22 11:01:12,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925386495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:01:12,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:01:12,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 76 [2022-07-22 11:01:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664914145] [2022-07-22 11:01:12,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:01:12,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-22 11:01:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:01:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-22 11:01:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4467, Unknown=132, NotChecked=710, Total=5700 [2022-07-22 11:01:12,189 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 76 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:27,366 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 86 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:01:29,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (select .cse0 4))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse7 (div (+ 4 (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) (.cse5 (<= .cse8 c_~N~0)) (.cse6 (<= c_~N~0 .cse8)) (.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse4 (* c_~N~0 4))) (and (or (not (= c_~N~0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= c_~N~0 .cse1)) (= 5 .cse1) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (< |v_ULTIMATE.start_main_~i~0#1_150| c_~N~0)) (forall ((v_ArrVal_487 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4)) v_ArrVal_487))) (or (not (= c_~N~0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= c_~N~0 (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))) (or (<= (+ .cse3 13 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4) (and .cse5 .cse6 (<= (+ .cse7 1) |c_ULTIMATE.start_main_~i~0#1|))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (and (<= (+ .cse7 2) |c_ULTIMATE.start_main_~i~0#1|) .cse5 .cse6) (<= (+ .cse3 9 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse4)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= c_~N~0 5) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= 5 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))))) is different from false